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

Commit29010b0

Browse files
author
haotf
committed
feat: dijkstra
1 parentcfcb131 commit29010b0

File tree

2 files changed

+109
-1
lines changed

2 files changed

+109
-1
lines changed

‎743.网络延迟时间.java‎

Lines changed: 62 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,10 @@
1+
importjava.util.Arrays;
2+
importjava.util.HashMap;
3+
importjava.util.LinkedList;
4+
importjava.util.List;
5+
importjava.util.Map;
6+
importjava.util.PriorityQueue;
7+
18
/*
29
* @lc app=leetcode.cn id=743 lang=java
310
*
@@ -6,9 +13,63 @@
613

714
// @lc code=start
815
classSolution {
16+
publicstaticList<int[]>[]graph;
17+
918
publicintnetworkDelayTime(int[][]times,intn,intk) {
19+
buildGraph(times,n);
20+
int[]distToTarget =newint[n +1];
21+
Arrays.fill(distToTarget,Integer.MAX_VALUE);
22+
distToTarget[k] =0;
23+
24+
PriorityQueue<State>pq =newPriorityQueue<State>((a,b) ->a.distFromStart -b.distFromStart);
25+
pq.add(newState(k,0));
26+
27+
while (!pq.isEmpty()) {
28+
Statestate =pq.poll();
29+
if (state.distFromStart >distToTarget[state.id])
30+
continue;
31+
List<int[]>targets =graph[state.id];
32+
for (int[]target :targets) {
33+
intt =target[0];
34+
intw =target[1];
35+
intdistFromStart =w +state.distFromStart;
36+
if (distToTarget[t] >distFromStart) {
37+
distToTarget[t] =distFromStart;
38+
pq.offer(newState(t,distFromStart));
39+
}
40+
}
41+
}
42+
intmax =0;
43+
for (inti =1;i <distToTarget.length;i++) {
44+
max =Math.max(max,distToTarget[i]);
45+
}
46+
47+
returnmax ==Integer.MAX_VALUE ? -1 :max;
48+
49+
}
1050

51+
privatestaticvoidbuildGraph(int[][]times,intn) {
52+
List<int[]>[]list =newLinkedList[n +1];
53+
for (inti =0;i <list.length;i++) {
54+
list[i] =newLinkedList<>();
55+
}
56+
for (int[]g :times) {
57+
intfrom =g[0];
58+
intto =g[1];
59+
intweight =g[2];
60+
list[from].add(newint[] {to,weight });
61+
}
62+
graph =list;
1163
}
1264
}
13-
// @lc code=end
1465

66+
classState {
67+
publicintid;
68+
publicintdistFromStart;
69+
70+
publicState(intid,intdistFromStart) {
71+
this.id =id;
72+
this.distFromStart =distFromStart;
73+
}
74+
}
75+
// @lc code=end

‎817.链表组件.java‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
importjava.util.ArrayList;
2+
importjava.util.Arrays;
3+
importjava.util.HashSet;
4+
importjava.util.List;
5+
importjava.util.Set;
6+
importjava.util.stream.Collectors;
7+
8+
/*
9+
* @lc app=leetcode.cn id=817 lang=java
10+
*
11+
* [817] 链表组件
12+
*/
13+
14+
// @lc code=start
15+
/**
16+
* Definition for singly-linked list.
17+
* public class ListNode {
18+
* int val;
19+
* ListNode next;
20+
* ListNode() {}
21+
* ListNode(int val) { this.val = val; }
22+
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
23+
* }
24+
*/
25+
classSolution {
26+
publicintnumComponents(ListNodehead,int[]nums) {
27+
Set<Integer>set =newHashSet<>(Arrays.stream(nums).boxed().collect(Collectors.toList()));
28+
intres =0;
29+
ListNodep =head;
30+
31+
booleanstart =false;
32+
while (p !=null) {
33+
if (set.contains(p.val)) {
34+
if (start ==false) {
35+
start =true;
36+
res++;
37+
}
38+
}else {
39+
start =false;
40+
}
41+
p =p.next;
42+
}
43+
44+
returnres;
45+
}
46+
}
47+
// @lc code=end

0 commit comments

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