LeetCode OJ——Plus One

http://oj.leetcode.com/problems/plus-one/

进位加法

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<int> ansVector;

        if(digits.empty())
            return digits;
        vector<int>::iterator iter = digits.end()-;

        while(iter!=digits.begin())
        {
            if(*iter!=)
            {
                *iter = *iter +;
                return digits;
            }
            *iter = ;
            iter--;
        }
        if(digits[]!=)
        {
            digits[]+=;
            return digits;
        }
        ansVector.push_back();
        for(int i = ;i<digits.size();i++)
        ansVector.push_back();
        return ansVector;
    }
};

int main()
{
    Solution mySolution;
    vector<int> input;
    input.push_back();
    input.push_back();
    mySolution.plusOne(input);
    return ;
}