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

Commit55f4dab

Browse files
add 1482
1 parentb25a834 commit55f4dab

File tree

3 files changed

+85
-0
lines changed

3 files changed

+85
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -249,6 +249,7 @@ _If you like this project, please leave me a star._ ★
249249
|1487|[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java)||Medium|HashTable, String|
250250
|1486|[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java)||Medium|Array, Bit Manipulation|
251251
|1485|[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java)||Medium|HashTable, Tree, DFS, BFS|
252+
|1482|[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java)||Medium|Array, Binary Search|
252253
|1481|[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java)||Medium|Array, Sort|
253254
|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java),[C++](../master/cpp/_1480.cpp)||Easy|Array|
254255
|1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java)||Medium|Array|
Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
packagecom.fishercoder.solutions;
2+
3+
publicclass_1482 {
4+
publicstaticclassSolution1 {
5+
/**
6+
* https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/discuss/686316/JavaC%2B%2BPython-Binary-Search
7+
*/
8+
publicintminDays(int[]bloomDay,intm,intk) {
9+
intn =bloomDay.length;
10+
intleft =1;
11+
intright =Integer.MAX_VALUE;
12+
if (m *k >n) {
13+
return -1;
14+
}
15+
while (left <right) {
16+
intmid =left + (right -left) /2;
17+
intflower =0;
18+
intbouq =0;
19+
for (intj =0;j <n;j++) {
20+
if (bloomDay[j] >mid) {
21+
flower =0;
22+
}elseif (++flower >=k) {
23+
bouq++;
24+
flower =0;
25+
}
26+
}
27+
if (bouq <m) {
28+
left =mid +1;
29+
}else {
30+
right =mid;
31+
}
32+
}
33+
returnleft;
34+
}
35+
}
36+
}
Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.solutions._1482;
4+
importcom.fishercoder.solutions._2024;
5+
importorg.junit.BeforeClass;
6+
importorg.junit.Test;
7+
8+
importstaticorg.junit.Assert.assertEquals;
9+
10+
publicclass_1482Test {
11+
privatestatic_1482.Solution1solution1;
12+
privatestaticintexpected;
13+
privatestaticint[]bloomDay;
14+
privatestaticintm;
15+
privatestaticintk;
16+
17+
@BeforeClass
18+
publicstaticvoidsetup() {
19+
solution1 =new_1482.Solution1();
20+
}
21+
22+
@Test
23+
publicvoidtest1() {
24+
expected =3;
25+
bloomDay =newint[]{1,10,3,10,2};
26+
m =3;
27+
k =1;
28+
assertEquals(expected,solution1.minDays(bloomDay,m,k));
29+
}
30+
31+
@Test
32+
publicvoidtest2() {
33+
expected = -1;
34+
bloomDay =newint[]{1,10,3,10,2};
35+
m =3;
36+
k =2;
37+
assertEquals(expected,solution1.minDays(bloomDay,m,k));
38+
}
39+
40+
@Test
41+
publicvoidtest3() {
42+
expected =9;
43+
bloomDay =newint[]{1,10,2,9,3,8,4,7,5,6};
44+
m =4;
45+
k =2;
46+
assertEquals(expected,solution1.minDays(bloomDay,m,k));
47+
}
48+
}

0 commit comments

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