447.Number of Boomerangs - 版本历史

2024年1月17日 (三) 16:51 Riguz

2024-01-17T16:51:47Z

@@ 第75行： / 第75行： @@
 P(n,2)=n * (n -1) * (n - 2) ...* 2 * 1/(n - 2) ...* 2 * 1=n * (n-1)
 <syntaxhighlight lang="java">
@@ 第102行： / 第133行： @@
+}
 </syntaxhighlight>
 [[Category:Algorithm]]
 [[Category:LeetCode]]

Riguz：/* Count distance */

2024-01-17T16:49:56Z

Count distance

←上一版本		2024年1月17日 (三) 16:49的版本
第80行：		第80行：
	public int numberOfBoomerangs(int[][] points) {		public int numberOfBoomerangs(int[][] points) {
	int sum = 0;		int sum = 0;
			Map<Integer, Integer> counts = new HashMap<>();
	for(int i = 0; i < points.length; i++) {		for(int i = 0; i < points.length; i++) {
	~~// 存储到i点 <distance, count>~~
	~~Map<Integer, Integer> counts = new HashMap<>();~~
	for(int j = 0; j < points.length; j++) {		for(int j = 0; j < points.length; j++) {
	if( i == j) continue;		if( i == j) continue;
	int dij = distance(points, i, j);		int dij = distance(points, i, j);
	~~int count =~~ counts.~~getOrDefault~~(dij, ~~0);~~		counts.put(dij, counts.getOrDefault(dij, 0) + 1);
	~~count ++;~~
	counts.~~put~~(dij, ~~count~~);
	}		}
	for(int count: counts.values()) {		for(int count: counts.values()) {
	~~// Am2排列~~
	sum += count * (count -1);		sum += count * (count -1);
	}		}
			counts.clear();
	}		}
	return sum;		return sum;
第105行：		第102行：
	}		}
	</syntaxhighlight>		</syntaxhighlight>

			== Count distance optimized==
			{{Submission\|runtime=92ms\|memory=76.8MB\|rp=43.2\|mp=29.6}}

	[[Category:Algorithm]]		[[Category:Algorithm]]
	[[Category:LeetCode]]		[[Category:LeetCode]]

Riguz：/* Count distance */

2024-01-17T16:42:29Z

Count distance

←上一版本		2024年1月17日 (三) 16:42的版本
第73行：		第73行：
	P(n,r) = \frac{n!}{(n-r)!}		P(n,r) = \frac{n!}{(n-r)!}
	</math>		</math>

			P(n,2)=n * (n -1) * (n - 2) ...* 2 * 1/(n - 2) ...* 2 * 1=n * (n-1)

	<syntaxhighlight lang="java">		<syntaxhighlight lang="java">

Riguz：/* Count distance */

2024-01-17T16:38:34Z

Count distance

←上一版本		2024年1月17日 (三) 16:38的版本
第67行：		第67行：

	<math>		<math>
	C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}		C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}
			</math>

			<math>
	P(n,r) = \frac{n!}{(n-r)!}		P(n,r) = \frac{n!}{(n-r)!}
	</math>		</math>

Riguz：/* Count distance */

2024-01-17T16:37:34Z

Count distance

←上一版本		2024年1月17日 (三) 16:37的版本
第65行：		第65行：
	== Count distance ==		== Count distance ==
	{{Submission\|runtime=137ms\|memory=45.36MB\|rp=43.2\|mp=8.8}}		{{Submission\|runtime=137ms\|memory=45.36MB\|rp=43.2\|mp=8.8}}

			<math>
			C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}
			P(n,r) = \frac{n!}{(n-r)!}
			</math>

	<syntaxhighlight lang="java">		<syntaxhighlight lang="java">

Riguz：/* Brute force */

2024-01-17T16:31:40Z

Brute force

@@ 第63行： / 第63行： @@
 </syntaxhighlight>
 [[Category:Algorithm]]
 [[Category:LeetCode]]

Riguz：Riguz移动页面447. Number of Boomerangs至447.Number of Boomerangs，不留重定向

2024-01-17T15:53:26Z

Riguz移动页面447. Number of Boomerangs至447.Number of Boomerangs，不留重定向

←上一版本		2024年1月17日 (三) 15:53的版本
（没有差异）

2024年1月17日 (三) 15:53 Riguz

2024-01-17T15:53:09Z

@@ 第8行： / 第8行： @@
 |title=Number of Boomerangs
 |summary=You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).}}
 [[Category:Algorithm]]
 [[Category:LeetCode]]

Riguz：创建页面，内容为“=Description= {{LeetCode |id=number-of-boomerangs |no=447 |difficulty=Medium |category=unknown |collection=Top 150 |title=Number of Boomerangs |summary=You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).}} Category:Algorithm Category:LeetCode”

2024-01-17T15:48:09Z

创建页面，内容为“=Description= {{LeetCode |id=number-of-boomerangs |no=447 |difficulty=Medium |category=unknown |collection=Top 150 |title=Number of Boomerangs |summary=You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).}} Category:Algorithm Category:LeetCode”

新页面

=Description=
{{LeetCode
|id=number-of-boomerangs
|no=447
|difficulty=Medium
|category=unknown
|collection=Top 150
|title=Number of Boomerangs
|summary=You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).}}

[[Category:Algorithm]]
[[Category:LeetCode]]

447.Number of Boomerangs - 版本历史

2024年1月17日 (三) 16:51 Riguz

Riguz：​/* Count distance */

Riguz：​/* Count distance */

Riguz：​/* Count distance */

Riguz：​/* Count distance */

Riguz：​/* Brute force */

Riguz：​Riguz移动页面447. Number of Boomerangs至447.Number of Boomerangs，不留重定向

2024年1月17日 (三) 15:53 Riguz

Riguz：/* Count distance */

Riguz：/* Count distance */

Riguz：/* Count distance */

Riguz：/* Count distance */

Riguz：/* Brute force */

Riguz：Riguz移动页面447. Number of Boomerangs至447.Number of Boomerangs，不留重定向