LeetCode - Majority Element

参考了别人的想法，思路简洁，效率高。虽然是在充分理解别人的思路后写出的代码，但是还是发现了自己的不足之处。以后还是要多思考多写。加油吧！

public class Solution {public int majorityElement(int[] num) {int ans = 0, cnt = 0;for(int i=0; i<num.length; i++) {if(cnt == 0) {ans = num[i];cnt ++;} else {if(ans == num[i]) {cnt ++;} else {cnt --;}}}return ans;}
}

转载于:https://www.cnblogs.com/wxisme/p/4376637.html

LeetCode - Majority Element相关推荐

LeetCode Majority Element
Given an array of size n, find the majority element. The majority element is the element that appear ...
[LeetCode] Majority Element
Given an array of size n, find the majority element. The majority element is the element that appear ...
[LeetCode]Majority Element
题目描述: Given an array of size n, find the majority element. The majority element is the element that ...
[Leetcode] Majority Element 众数
Majority Element I Given an array of size n, find the majority element. The majority element is the ...
[LeetCode] Majority Element II
Majority Element II Given an integer array of size n, find all elements that appear more than ⌊ n/3 ...
LeetCode Majority Element II(Moore Voting Algorithm即Majority Voting Algorithm)
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algo ...
[leetcode]Majority Element II
思路:可以使用三向切分的快速排序算法,因为这种算法会把小于某个数,等于某个数,和大于某个数的分开,分成三部分.很容易判断等于某个数的全部数量,对于这种重复值问题,很有效. public class S ...
【LeetCode】169. Majority Element
原题链接:https://leetcode.com/problems/majority-element/description/ 要求: Given an array of size n, find ...
[LeetCode] 169. Majority Element 多数元素
Given an array of size n, find the majority element. The majority element is the element that appear ...

LeetCode - Majority Element

LeetCode - Majority Element相关推荐

最新文章

热门文章