Oct 9, 2024 · Sep 24, 2024 · Sep 25, 2024 · Sep 25, 2024 · Oct 9, 2024 · Oct 9, 2024
diff --git a/problems/0134.加油站.md b/problems/0134.加油站.md
diff --git a/problems/kamacoder/0053.寻宝-Kruskal.md b/problems/kamacoder/0053.寻宝-Kruskal.md
diff --git a/problems/kamacoder/0053.寻宝-prim.md b/problems/kamacoder/0053.寻宝-prim.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -158,7 +158,7 @@ i从0开始累加rest[i],和记为curSum,一旦curSum小于零,说明[0, i

		如果 curSum<0 说明区间和1 + 区间和2 < 0, 那么假设从上图中的位置开始计数curSum不会小于0的话,就是区间和2>0。

	区间和1 + 区间和2 < 0 同时区间和2>0,只能说明区间和1 < 0, 那么就会从假设的箭头初就开始从新选择其实位置了。
	区间和1 + 区间和2 < 0 同时区间和2>0,只能说明区间和1 < 0, 那么就会从假设的箭头初就开始从新选择起始位置了。


		那么局部最优:当前累加rest[i]的和curSum一旦小于0,起始位置至少要是i+1,因为从i之前开始一定不行。全局最优:找到可以跑一圈的起始位置。
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -549,6 +549,62 @@ if __name__ == "__main__":

		### Javascript

	```js
	function kruskal(v, edges) {
	const father = Array.from({ length: v + 1 }, (_, i) => i)

	function find(u){
	if (u === father[u]) {
	return u
	} else {
	father[u] = find(father[u])
	return father[u]
	}

	}

	function isSame(u, v) {
	let s = find(u)
	let t = find(v)
	return s === t
	}

	function join(u, v) {
	let s = find(u)
	let t = find(v)
	if (s !== t) {
	father[s] = t
	}
	}

	edges.sort((a, b) => a[2] - b[2])
	let result = 0
	for (const [v1, v2, w] of edges) {
	if (!isSame(v1, v2)) {
	result += w
	join(v1 ,v2)
	}
	}
	console.log(result)
	}


	async function main() {
	const rl = require('readline').createInterface({ input: process.stdin })
	const iter = rl[Symbol.asyncIterator]()
	const readline = async () => (await iter.next()).value
	const [v, e] = (await readline()).split(" ").map(Number)
	const edges = []
	for (let i = 0 ; i < e ; i++) {
	edges.push((await readline()).split(" ").map(Number))
	}
	kruskal(v, edges)
	}


	main()
	```

		### TypeScript

		### PhP
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -693,6 +693,55 @@ if __name__ == "__main__":
		### Rust

		### Javascript
	```js
	function prim(v, edges) {
	const grid = Array.from({ length: v + 1 }, () => new Array(v + 1).fill(10001)); // Fixed grid initialization
	const minDist = new Array(v + 1).fill(10001)
	const isInTree = new Array(v + 1).fill(false)
	// 建構鄰接矩陣
	for(const [v1, v2, w] of edges) {
	grid[v1][v2] = w
	grid[v2][v1] = w
	}
	// prim 演算法
	for (let i = 1 ; i < v ; i++) {
	let cur = -1
	let tempMinDist = Number.MAX_VALUE
	// 1. 尋找距離生成樹最近的節點
	for (let j = 1 ; j < v + 1 ; j++) {
	if (!isInTree[j] && minDist[j] < tempMinDist) {
	tempMinDist = minDist[j]
	cur = j
	}
	}
	// 2. 將節點放入生成樹
	isInTree[cur] = true
	// 3. 更新非生成樹節點與生成樹的最短距離
	for (let j = 1 ; j < v + 1 ; j++) {
	if (!isInTree[j] && grid[cur][j] < minDist[j]) {
	minDist[j] = grid[cur][j]
	}
	}
	}
	console.log(minDist.slice(2).reduce((acc, cur) => acc + cur, 0))
	}


	async function main() {
	const rl = require('readline').createInterface({ input: process.stdin })
	const iter = rl[Symbol.asyncIterator]()
	const readline = async () => (await iter.next()).value
	const [v, e] = (await readline()).split(" ").map(Number)
	const edges = []
	for (let i = 0 ; i < e ; i++) {
	edges.push((await readline()).split(" ").map(Number))
	}
	prim(v, edges)
	}


	main()
	```

		### TypeScript

Expand Down