【10_169】Majority Element

今天遇到的题都挺难的，不容易有会做的。

下面是代码，等明天看看Discuss里面有没有简单的方法~

Majority Element

My Submissions

Question

Total Accepted: 79833 Total Submissions: 208075 Difficulty: Easy

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Java写法，遇到一个数字就标记一次，最后看谁的标记数目大于 ⌊ n/2 ⌋

 public class Solution {
     public int majorityElement(int[] nums) {
         int n = nums.length;
         int[][] count = new int[n][2];
         for (int i = 0; i < n; i++) {
             count[i][1] = 0;
         }

         count[0][0] = nums[0];
         count[0][1] = 1;
         int ss = 1;
         for (int i = 1; i < n; i++) {
             for (int j = 0; j < ss; j++) {
                 if(count[j][0] == nums[i]) {
                     count[j][1]++;
                 }
                 else if (j == ss - 1)  {
                     count[ss][0] = nums[i];
                     ss++;
                 }
             }
         }
         int pan;
         if(n % 2 == 0)
             pan = n / 2;
         else
             pan = (n - 1) / 2;
         for (int i = 0; i < n; i++) {
             if(count[i][1] > pan)
                 return count[i][0];
         }

         return 0;
     }
 }