LeetCode 66. Plus One

描述

对一个vector数组加1.

解决

模拟

---

class Solution {public:vector<int> plusOne(vector<int>& digits) {    int lenth = digits.size();    vector<int> tmp(lenth + 1, 0);    digits[lenth - 1] += 1;                  for (int i = lenth - 1; i >= 0; --i){        //cout << digits[i] << endl;        if (digits[i] >= 10){            tmp[i + 1] = digits[i] - 10;            tmp[i] += 1;        }else{            tmp[i + 1] += digits[i];            if (tmp[i + 1] >= 10){                tmp[i + 1] -= 10;                tmp[i] += 1;            }        }    }    vector<int>::iterator it = tmp.begin();    ++it;    return tmp[0] == 0 ? vector<int>(it,tmp.end()) : tmp;}};