[leetcode]169. Majority Element

class Solution {public:    int majorityElement(vector<int>& nums) {        int len=nums.size();        int key=nums[0];        int value=0;        for(int i=0;i<len;i++)        {            if(value==0)            {                key=nums[i];                value++;            }            else            {                if(key==nums[i])                value++;                else                value--;            }        }        return key;    }};