力扣,https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/description/
思路:
法1:数组排序法
class Solution {
public int inventoryManagement(int[] stock) {
List<Integer> list = new ArrayList<>();
for (int i : stock) {
list.add(i);
}
Collections.sort(list);
return list.get(list.size() / 2);
}
}
法2:摩尔投票法
class Solution {
public int inventoryManagement(int[] stock) {
int res = 0, votes = 0;
for (int num : stock) {
if (votes == 0) {
res = num;
}
votes += res == num ? 1 : -1;
}
return res;
}
}
##Solution1:
20180902日整理
注意几点:
1.若下一个数字和我们之前保存的数字相同,则次数 +1
2.若下一个数字和我们之前保存的数字不同,则次数 -1
3.如果次数为0,我们需要保存下一个数字,并把次数置为1
4.查完数要检查,防止{1,2,3,4,4}这种情况
class Solution {
public:
int MoreThanHalfNum_Solution(vector<int> numbers) {
if(numbers.empty())
return 0;
else if(numbers.size() == 1)
return numbers[0];
int temp = numbers[0],temp_value=1;
for(int i = 1; i<numbers.size(); i++){
if(temp_value == 0){
temp = numbers[i];
temp_value = 1;
}
else if(numbers[i] == temp)
temp_value++;
else if(numbers[i] != temp)
temp_value--;
}
//考虑到输入的数组中可能不存在出现次数超过数组长度一半的数字,则需要验证
if(temp_value == 0)
return 0;
else{
temp_value = 0;
for(int i = 0; i < numbers.size(); i++){
if(numbers[i] == temp)
temp_value++;
}
return 2*temp_value>numbers.size()? temp:0;
}
}
};