66. Plus One

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

这题我坚信leetcode出了问题，欢迎同学们来交流~

我的思路是是这给的是一个二进制的数字，那么从最后一个找起，只要是1就变0，直到遇到0为止。如果全部都是1的话，就把第一位变成1，在最后加一位0.

class Solution {public:    vector<int> plusOne(vector<int>& digits) {        int p=1;        for(int i=digits.size()-1;i>=0;i--){            if(digits[i]==1) digits[i]=0;            else {digits[i]=1;p=0;break;}        }        if(p){digits[0]=1;digits.push_back(0);}        return digits;    }};