LeetCode: Plus One

考vector的insert操作，一次过

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int carry = 0;
        digits[digits.size()-1]++;
        for (int i = digits.size()-1; i >= 0; i--) {
            digits[i] += carry;
            carry = digits[i]/10;
            digits[i] %= 10;
        }
        if (carry) digits.insert(digits.begin(), carry);
        return digits;
    }
};

 C#

public class Solution {
    public int[] PlusOne(int[] digits) {
        int c = 0;
        digits[digits.Length-1]++;
        for (int i = digits.Length-1; i >= 0; i--) {
            digits[i] += c;
            c = digits[i] / 10;
            digits[i] %= 10;
        }
        if (c > 0) {
            int[] ans = new int[digits.Length+1];
            ans[0] = c;
            for (int i = 1; i <= digits.Length; i++) ans[i] = digits[i-1];
            return ans;
        }
        else {
            int[] ans = new int[digits.Length];
            digits.CopyTo(ans, 0);
            return ans;
        }
    }
}