Q：
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.
A1：
class Solution {
int[] num) {
3:
int major=num[0], count = 1;
int i=1; i<num.length;i++){
if(count==0){
7: count++;
8: major=num[i];
if(major==num[i]){
10: count++;
else count--;
12:
13: }
return major;
15: }
16: }
A2：
class Solution {
int[] num) {
3: Arrays.sort(num);
return num[num.length / 2];
5: }
6: }