leecode 解题总结：66. Plus One

class Solution {public:    vector<int> plusOne(vector<int>& digits) {        if(digits.empty()){return digits;}int len = digits.size();int carry = 0;int temp;for(int i = len - 1 ; i >= 0 ; i--){temp = digits.at(i) + carry;if(len - 1 == i){temp += 1;}//计算进位digits.at(i) = temp % 10;carry = temp / 10;}//判断最后是否有进位,在数组头部插入进位if(carry > 0){digits.insert(digits.begin() , carry);}return digits;    }};