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

Commit897a32d

Browse files
committed
Modified 2 solutions
1 parent56cb3fd commit897a32d

File tree

2 files changed

+46
-44
lines changed

2 files changed

+46
-44
lines changed

‎Easy/Search Insert Position.java

Lines changed: 15 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -1,26 +1,25 @@
11
classSolution {
22
publicintsearchInsert(int[]nums,inttarget) {
3-
intlow =0;
4-
inthigh =nums.length-1;
5-
6-
if (nums[low] >=target) {
7-
return0;
8-
}
9-
10-
if (nums[high] <target) {
11-
returnhigh +1;
12-
}
3+
returnbinarySearch(nums,target);
4+
}
5+
6+
privateintbinarySearch(int[]nums,inttarget) {
7+
intleft =0;
8+
intright =nums.length -1;
139

14-
while (low <high) {
15-
intmid = (low +high)/2;
16-
if (nums[mid] <target) {
17-
low =mid+1;
10+
while (left <=right) {
11+
intmid = (left +right) /2;
12+
if (nums[mid] ==target) {
13+
returnmid;
14+
}
15+
elseif (nums[mid] >target) {
16+
right =mid -1;
1817
}
1918
else {
20-
high =mid;
19+
left =mid +1;
2120
}
2221
}
2322

24-
returnlow;
23+
returnleft;
2524
}
2625
}

‎Medium/Friend Circles.java

Lines changed: 31 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -1,41 +1,44 @@
11
classSolution {
22
publicintfindCircleNum(int[][]M) {
3-
Map<Integer,List<Integer>>map =newHashMap<>();
4-
for (inti=0;i<M.length;i++) {
5-
for (intj=0;j<M[i].length;j++) {
3+
Map<Integer,Set<Integer>>map =newHashMap<>();
4+
for (inti =0;i <M.length;i++) {
5+
for (intj =0;j <M.length;j++) {
66
if (M[i][j] ==1) {
7-
map.computeIfAbsent(i,k ->newArrayList<>()).add(j);
8-
map.computeIfAbsent(j,k ->newArrayList<>()).add(i);
7+
map.computeIfAbsent(i,k ->newHashSet<>()).add(j);
98
}
109
}
1110
}
12-
13-
Set<Integer>set =newHashSet<>();
11+
12+
returndfs(map,M.length);
13+
}
14+
15+
privateintdfs(Map<Integer,Set<Integer>>map,intn) {
1416
intcount =0;
15-
Queue<Integer>queue =newLinkedList<>();
16-
17-
for (Map.Entry<Integer,List<Integer>>entry :map.entrySet()) {
18-
if (set.contains(entry.getKey())) {
19-
continue;
17+
Set<Integer>seen =newHashSet<>();
18+
19+
for (inti =0;i <n;i++) {
20+
if (!seen.contains(i)) {
21+
dfsHelper(i,seen,map);
22+
count++;
2023
}
21-
22-
queue.add(entry.getKey());
23-
24-
while (!queue.isEmpty()) {
25-
intpopped =queue.remove();
26-
set.add(popped);
27-
List<Integer>list =map.get(popped);
28-
29-
for (Integerinteger :list) {
30-
if (!set.contains(integer)) {
31-
queue.add(integer);
32-
}
24+
}
25+
26+
returncount;
27+
}
28+
29+
privatevoiddfsHelper(intidx,Set<Integer>seen,Map<Integer,Set<Integer>>map) {
30+
Queue<Integer>queue =newLinkedList<>();
31+
queue.add(idx);
32+
33+
while (!queue.isEmpty()) {
34+
intremoved =queue.remove();
35+
seen.add(removed);
36+
37+
for (intfriend :map.getOrDefault(removed,newHashSet<>())) {
38+
if (!seen.contains(friend)) {
39+
queue.add(friend);
3340
}
3441
}
35-
36-
count++;
3742
}
38-
39-
returncount;
4043
}
4144
}

0 commit comments

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