169. Majority Element

题目：https://leetcode.com/problems/majority-element/

代码：

public class Solution {    public int majorityElement(int[] nums) {        Arrays.sort(nums);        int limit = (int)(nums.length/2.0);        int m=0,n=1,count;        while(m<nums.length&&n<nums.length)        {            count=1;            while(n<nums.length&&nums[m] == nums[n])            {                count++;                n++;            }            if(count>limit)                break;            else            {                m = n;                n++;            }        }        return nums[m];    }}用双点法做的=====================有个超牛逼的答案public class Solution {    public int majorityElement(int[] nums) {        Arrays.sort(nums);        return nums[nums.length/2];    }}