Majority Element

1. Title

Majority Element

2. Http address

https://leetcode.com/problems/majority-element/

3. The question

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

4 My code(AC)

        // Accepted
       public static int majorityElementTwo(int[] nums) {
        
           Arrays.sort(nums);
           int len = nums.length;
           int count,bf;
           bf = nums[0];
           count=1;
           for(int i = 1 ; i < len; i++)
           {
               if( count > len /2)
               {
                   return bf;
               }
               
               if( nums[i] == bf)
               {
                   count++;
               }else{
                   bf = nums[i];
                   count = 1;
               }
               
           }
           return nums[len-1];
       }