Skip to content

✨update: Modify 229 & 447 #409

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Mar 14, 2022
Merged

✨update: Modify 229 & 447 #409

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b3e87cc
✨update: Modify 229
SharingSource Mar 14, 2022
9fd0c82
✨update: Modify 447
SharingSource Mar 14, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions LeetCode/221-230/229. 求众数 II（中等）.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,9 +2,9 @@

这是 LeetCode 上的 **[229. 求众数 II](https://leetcode-cn.com/problems/majority-element-ii/solution/gong-shui-san-xie-noxiang-xin-ke-xue-xi-ws0rj/)** ，难度为 **中等**。

Tag : 「摩尔投票」、「哈希表」


Tag : 「摩尔投票」、「哈希表」

给定一个大小为 `n` 的整数数组，找出其中所有出现超过 `⌊ n/3 ⌋` 次的元素。

Expand Down Expand Up @@ -32,7 +32,7 @@ Tag : 「摩尔投票」、「哈希表」
* $-10^9 <= nums[i] <= 10^9$


进阶：尝试设计时间复杂度为 O(n)、空间复杂度为 O(1)的算法解决此问题。
进阶：尝试设计时间复杂度为 $O(n)$、空间复杂度为 $O(1)$ 的算法解决此问题。

---

Expand Down
10 changes: 6 additions & 4 deletions LeetCode/441-450/447. 回旋镖的数量（中等）.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,8 @@

Tag : 「哈希表」、「模拟」



给定平面上 `n` 对 互不相同 的点 `points`，其中 `points[i] = [xi, yi]` 。回旋镖 是由点 `(i, j, k)` 表示的元组 ，其中 `i` 和 `j` 之间的距离和 `i` 和 `k` 之间的距离相等（需要考虑元组的顺序）。

返回平面上所有回旋镖的数量。
Expand Down Expand Up @@ -31,10 +33,10 @@ Tag : 「哈希表」、「模拟」
```

提示：
* n == points.length
* 1 <= n <= 500
* points[i].length == 2
* -$10^4$ <= xi, yi <= $10^4$
* $n == points.length$
* $1 <= n <= 500$
* $points[i].length == 2$
* -$10^4 <= x_i, y_i <= 10^4$
* 所有点都 互不相同

---
Expand Down