Skip to content

feat: add javascript solution to lcci problem: No.1864.Minimum Number… #387

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 17, 2021
Merged

feat: add javascript solution to lcci problem: No.1864.Minimum Number… #387

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 33 additions & 0 deletions ...99/1864.Minimum Number of Swaps to Make the Binary String Alternating/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,6 +69,39 @@

```

### **JavaScript**

```js
/**
* @param {string} s
* @return {number}
*/
var minSwaps = function(s) {
let n = s.length;
let n1 = [...s].reduce((a, c) => parseInt(c) + a, 0);
let n0 = n - n1;
let count = Infinity;
let half = n / 2;
// 101、1010
if (n1 == Math.ceil(half) && n0 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '1') cur++;
}
count = Math.min(count, cur);
}
// 010、0101
if (n0 == Math.ceil(half) && n1 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '0') cur++;
}
count = Math.min(count, cur);
}
return count == Infinity ? -1 : count;
};
```

### **...**

```
Expand Down
33 changes: 33 additions & 0 deletions ...1864.Minimum Number of Swaps to Make the Binary String Alternating/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,6 +60,39 @@ The string is now alternating.

```

### **JavaScript**

```js
/**
* @param {string} s
* @return {number}
*/
var minSwaps = function(s) {
let n = s.length;
let n1 = [...s].reduce((a, c) => parseInt(c) + a, 0);
let n0 = n - n1;
let count = Infinity;
let half = n / 2;
// 101、1010
if (n1 == Math.ceil(half) && n0 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '1') cur++;
}
count = Math.min(count, cur);
}
// 010、0101
if (n0 == Math.ceil(half) && n1 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '0') cur++;
}
count = Math.min(count, cur);
}
return count == Infinity ? -1 : count;
};
```

### **...**

```
Expand Down
28 changes: 28 additions & 0 deletions .../1800-1899/1864.Minimum Number of Swaps to Make the Binary String Alternating/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
/**
* @param {string} s
* @return {number}
*/
var minSwaps = function(s) {
let n = s.length;
let n1 = [...s].reduce((a, c) => parseInt(c) + a, 0);
let n0 = n - n1;
let count = Infinity;
let half = n / 2;
// 101、1010
if (n1 == Math.ceil(half) && n0 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '1') cur++;
}
count = Math.min(count, cur);
}
// 010、0101
if (n0 == Math.ceil(half) && n1 == Math.floor(half)) {
let cur = 0;
for (let i = 0; i < n; i++) {
if (i % 2 == 0 && s.charAt(i) != '0') cur++;
}
count = Math.min(count, cur);
}
return count == Infinity ? -1 : count;
};