Leetcode#169 Majority Element

原题地址

寻找主元素

非常巧妙的方法

代码：

int majorityElement(vector<int> &num) {
  int candidate = 0;
  int count = 0;
        
  for (int i = 0; i < num.size(); i++) {
    if (count == 0) {
      candidate = num[i];
      count = 1;
    }
    else
      count += candidate == num[i] ? 1 : -1;
  }
        
  return candidate;
}