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

Commit7a7e795

Browse files
add 2050
1 parent8b9c165 commit7a7e795

File tree

3 files changed

+102
-0
lines changed

3 files changed

+102
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|-----|----------------|---------------|--------|-------------|-------------
11+
|2050|[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2050.java)||Hard||
1112
|2048|[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2048.java)||Medium||
1213
|2047|[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2047.java)||Easy||
1314
|2044|[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2044.java)||Medium||
Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
packagecom.fishercoder.solutions;
2+
3+
importjava.util.HashMap;
4+
importjava.util.HashSet;
5+
importjava.util.LinkedList;
6+
importjava.util.Map;
7+
importjava.util.Queue;
8+
importjava.util.Set;
9+
10+
publicclass_2050 {
11+
publicstaticclassSolution1 {
12+
13+
/**
14+
* My original solution, but results in TLE on LeetCode at 39/40 test cases...
15+
*/
16+
publicintminimumTime(intn,int[][]relations,int[]time) {
17+
Map<Integer,Set<Integer>>prereqMap =newHashMap<>();
18+
for (int[]rel :relations) {
19+
intpre =rel[0];
20+
intthen =rel[1];
21+
Set<Integer>list =prereqMap.getOrDefault(then,newHashSet<>());
22+
list.add(pre);
23+
prereqMap.put(then,list);
24+
}
25+
Queue<Integer>queue =newLinkedList<>();
26+
Map<Integer,Integer>minMap =newHashMap<>();
27+
for (inti =0;i <n;i++) {
28+
if (!prereqMap.containsKey(i +1)) {
29+
minMap.put(i +1,time[i]);
30+
}else {
31+
queue.add(i +1);
32+
}
33+
}
34+
intminTime =0;
35+
while (!queue.isEmpty()) {
36+
Integercurr =queue.poll();
37+
intthisMinTime =Integer.MIN_VALUE;
38+
Set<Integer>reqs =prereqMap.get(curr);
39+
booleanvalid =true;
40+
for (intr :reqs) {
41+
if (!minMap.containsKey(r)) {
42+
queue.offer(curr);
43+
valid =false;
44+
break;
45+
}else {
46+
thisMinTime =Math.max(minMap.get(r),thisMinTime);
47+
}
48+
}
49+
if (valid) {
50+
minMap.put(curr,thisMinTime +time[curr -1]);
51+
}
52+
}
53+
for (intkey :minMap.keySet()) {
54+
minTime =Math.max(minTime,minMap.get(key));
55+
}
56+
returnminTime;
57+
}
58+
59+
}
60+
}
Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.common.utils.CommonUtils;
4+
importcom.fishercoder.solutions._2050;
5+
importorg.junit.BeforeClass;
6+
importorg.junit.Test;
7+
8+
importstaticorg.junit.Assert.assertEquals;
9+
10+
publicclass_2050Test {
11+
privatestatic_2050.Solution1solution1;
12+
privatestaticint[][]relation;
13+
privatestaticint[]time;
14+
privatestaticintn;
15+
privatestaticintexpected;
16+
17+
@BeforeClass
18+
publicstaticvoidsetup() {
19+
solution1 =new_2050.Solution1();
20+
}
21+
22+
@Test
23+
publicvoidtest1() {
24+
n =3;
25+
relation =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,3],[2,3]");
26+
time =newint[]{3,2,5};
27+
expected =8;
28+
assertEquals(expected,solution1.minimumTime(n,relation,time));
29+
}
30+
31+
@Test
32+
publicvoidtest2() {
33+
n =5;
34+
relation =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,5],[2,5],[3,5],[3,4],[4,5]");
35+
time =newint[]{1,2,3,4,5};
36+
expected =12;
37+
assertEquals(expected,solution1.minimumTime(n,relation,time));
38+
}
39+
40+
41+
}

0 commit comments

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