LintCode-剑指Offer-(46)主元素

class Solution {
public:
/**
* @param nums: A list of integers
* @return: The majority number
*/
int majorityNumber(vector<int> nums) {
// write your code here
int numcount = 0;
for (int i = 0;i<nums.size();i++){
for (int j = 0;j<nums.size();j++){
if (nums[j]==nums[i]){
numcount++;
if (numcount>nums.size()/2){
return nums[i];
}
}
}
}
}
};