先将数组排序,如果array[i] = array[i +mid];则存在
class Solution {
public int majorityElement(int[] nums) {
Arrays.sort(nums);
int mid = nums.length / 2;
for (int i = 0; i< nums.length - mid ; i ++ ){
if (nums[i] == nums[i + mid]){
return nums[i];
}
}
return - 1;
}
}