Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit5a98d2c

Browse files
add 1151
1 parente11d2ba commit5a98d2c

File tree

3 files changed

+99
-0
lines changed

3 files changed

+99
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -407,6 +407,7 @@ _If you like this project, please leave me a star._ ★
407407
|1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java)||Easy||
408408
|1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java)||Easy||
409409
|1152|[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java)|[:tv:](https://youtu.be/V510Lbtrm5s)|Medium|HashTable, Sort, Array|
410+
|1151|[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java)||Medium|Array, Sliding Window|
410411
|1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java)|[:tv:](https://youtu.be/-t2cdVs9cKk)|Easy||
411412
|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/)|[Javascript](./javascript/_1146.js)|| Easy||
412413
|1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) | |Medium||String, DP
Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
packagecom.fishercoder.solutions;
2+
3+
publicclass_1151 {
4+
publicstaticclassSolution1 {
5+
/**
6+
* My completely original solution on 11/4/2021.
7+
* Typical sliding window problem/solution
8+
*/
9+
publicintminSwaps(int[]data) {
10+
intoneCount =0;
11+
for (intd :data) {
12+
if (d ==1) {
13+
oneCount++;
14+
}
15+
}
16+
if (oneCount <=1) {
17+
return0;
18+
}
19+
intleft =0;
20+
intright =0;
21+
intones =0;
22+
intzeroes =0;
23+
intminSwaps =data.length;
24+
while (right <data.length) {
25+
if (data[right] ==1) {
26+
ones++;
27+
}else {
28+
zeroes++;
29+
}
30+
if (ones +zeroes ==oneCount) {
31+
minSwaps =Math.min(minSwaps,zeroes);
32+
if (data[left] ==1) {
33+
ones--;
34+
}else {
35+
zeroes--;
36+
}
37+
left++;
38+
}
39+
right++;
40+
}
41+
returnminSwaps;
42+
}
43+
}
44+
}
Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.solutions._1151;
4+
importorg.junit.BeforeClass;
5+
importorg.junit.Test;
6+
7+
importstaticorg.junit.Assert.assertEquals;
8+
9+
publicclass_1151Test {
10+
privatestatic_1151.Solution1solution1;
11+
privatestaticint[]data;
12+
privatestaticintexpected;
13+
14+
@BeforeClass
15+
publicstaticvoidsetup() {
16+
solution1 =new_1151.Solution1();
17+
}
18+
19+
@Test
20+
publicvoidtest1() {
21+
data =newint[]{1,0,1,0,1};
22+
expected =1;
23+
assertEquals(expected,solution1.minSwaps(data));
24+
}
25+
26+
@Test
27+
publicvoidtest2() {
28+
data =newint[]{0,0,0,1,0};
29+
expected =0;
30+
assertEquals(expected,solution1.minSwaps(data));
31+
}
32+
33+
@Test
34+
publicvoidtest3() {
35+
data =newint[]{1,0,1,0,1,0,0,1,1,0,1};
36+
expected =3;
37+
assertEquals(expected,solution1.minSwaps(data));
38+
}
39+
40+
@Test
41+
publicvoidtest4() {
42+
data =newint[]{1,0,1,0,1,0,1,1,1,0,1,0,0,1,1,1,0,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,0,1};
43+
expected =8;
44+
assertEquals(expected,solution1.minSwaps(data));
45+
}
46+
47+
@Test
48+
publicvoidtest5() {
49+
data =newint[]{0,0,0,0,0,0,0,0,0,0,0,0};
50+
expected =0;
51+
assertEquals(expected,solution1.minSwaps(data));
52+
}
53+
54+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp