wsy182
/
Solution
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

更新 Solution.java

master
wangsiyuan 2023-09-12 15:12:36 +08:00
parent 465b042d7e
commit 2277ac48a3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/solution/Solution.java
View File

@ -49,7 +49,7 @@ public class Solution {
} }
//哈希映射算法（Hash Mapping Algorithm）用于找出一个数组中的众数（majority element） //哈希映射算法(Hash Mapping Algorithm)用于找出一个数组中的众数(majority element)
public static int majorityElement(int[] nums) { public static int majorityElement(int[] nums) {
Map<Integer, Integer> map = new HashMap<>(); Map<Integer, Integer> map = new HashMap<>();
// maxNum 表示元素，maxCount 表示元素出现的次数 // maxNum 表示元素，maxCount 表示元素出现的次数
@ -64,7 +64,7 @@ public class Solution {
} }
return maxNum; return maxNum;
} }
//摩尔投票算法（Boyer-Moore Voting Algorithm）来找出数组中的众数 //摩尔投票算法(Boyer-Moore Voting Algorithm)来找出数组中的众数
public static int majorityElement1(int[] nums) { public static int majorityElement1(int[] nums) {
int candidate = nums[0], count = 1; int candidate = nums[0], count = 1;
for (int i = 1; i < nums.length; ++i) { for (int i = 1; i < nums.length; ++i) {