Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge 2bd7df84c73128b82a533a59f3b80fc601e58ab6 into b70121d377cb6005eb65f12b098cd5decd905669

Browse Source
This commit is contained in:
Jinhong Liu 2023-07-20 02:07:07 -07:00 committed by GitHub
commit 1b92893862
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
notes/39. 数组中出现次数超过一半的数字.md
View File

@ -12,10 +12,11 @@
public int MoreThanHalfNum_Solution(int[] nums) { public int MoreThanHalfNum_Solution(int[] nums) {
int majority = nums[0]; int majority = nums[0];
for (int i = 1, cnt = 1; i < nums.length; i++) { for (int i = 1, cnt = 1; i < nums.length; i++) {
cnt = nums[i] == majority ? cnt + 1 : cnt - 1;
if (cnt == 0) { if (cnt == 0) {
majority = nums[i]; majority = nums[i];
cnt = 1; cnt = 1;
} else {
cnt = nums[i] == majority ? cnt + 1 : cnt - 1;
} }
} }
int cnt = 0; int cnt = 0;