Create Readme.md

thisistrue1 · Apr 24, 2023 · 99ac886 · 99ac886
1 parent fcc93da
commit 99ac886
Showing 1 changed file with 3 additions and 0 deletions.
diff --git a/...he-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/Readme.md b/...he-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/Readme.md
@@ -0,0 +1,3 @@
+### 1334.Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance
+
+本题就是Floy的模板题，用o(N^3)时间可以计算出任意两点之间的最短距离，然后再用o(N^2)寻找答案。