class Solution {

public:

       int majorityElement(vector<int>& nums) {

        int candidate;

        int ntimes,i;

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

            if(ntimes == ){

                candidate = nums[i],ntimes = ;

            }

            else{

                if(candidate == nums[i]) ntimes ++;

                else ntimes--;

            }

        }

        return candidate;

    }

};