public class Solution {

     /*

      * @param nums: a list of integers

      * @return: find a  majority number

      */

     public int majorityNumber(List<Integer> nums) {

         // write your code here

         HashMap<Integer,Integer> h = new HashMap<Integer,Integer>();

         int major = 0;

         for(int i=0; i<nums.size(); i++) {

             //如果该元素已存在HashMap之中

             if(h.containsKey(nums.get(i))) {

                 //将元素个数取出，并加1，再存回去

                 int num = h.get(nums.get(i));

                 num += 1;

                 h.put(nums.get(i), num);

             }else {

                 h.put(nums.get(i), 1);

             }

         }

         int mid = nums.size()/2;

         for(int i=0; i<nums.size(); i++) {

             if(h.get(nums.get(i)) > mid) {

                 major = nums.get(i);

                 break;

             }

         }

         return major;

     }

 }