Two lines Java solutions


  • 0
    K

    element that appears more than ⌊ n/2 ⌋ times,so after sort the array,the result must be the middle element.
    public class Solution {
    public int majorityElement(int[] nums) {
    Arrays.sort(nums);
    return nums[nums.length / 2];
    }
    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.