We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent abcc85f commit 2ef3870Copy full SHA for 2ef3870
LeetcodeProblems/Algorithms/easy/Lexographic_smallest_after_swap.js
@@ -59,12 +59,12 @@ how to check the parity of the number:
59
* @return {string}
60
*/
61
var getSmallestString = function(s) {
62
- let arr = s.split('').map(Number);
+ let arr = s.split("").map(Number);
63
64
const getParity = (num) => {
65
- if(num&1 === 0) return 'even';
66
- else return 'odd';
67
- }
+ if(num&1 === 0) return "even";
+ else return "odd";
+ };
68
69
for(let i = 0; i< s.length - 1; i++) {
70
if(arr[i] > arr[i+1] && getParity(arr[i]) === getParity(arr[i + 1])) {
@@ -75,7 +75,7 @@ var getSmallestString = function(s) {
75
}
76
77
78
- return arr.join('');
+ return arr.join("");
79
};
80
81
module.exports.getSmallestString = getSmallestString;
0 commit comments