GeezerVison is showing github.com — Algorithm/leetcode_solved/leetcode_0066_Plus_One.cpp at master · OneCodeMonkey/Algorithm

Expand file tree

leetcode_0066_Plus_One.cpp

Copy path

More file actions

32 lines (30 loc) · 855 Bytes

Copy path

32 lines (30 loc) · 855 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

/**

* AC:

* Runtime: 4 ms, faster than 65.48% of C++ online submissions for Plus One.

* Memory Usage: 8.3 MB, less than 100.00% of C++ online submissions for Plus One.

* 思路：写一个按位递进的判断，用一个变量记录上一个位置有无进位就行了。

class Solution {

public:

vector<int> plusOne(vector<int>& digits) {

int size = digits.size();

vector<int> ans;

int flag = 1; // 是否需要进位

for(int i = size - 1; i >= 0; i--) {

if(flag == 1) {

if(digits[i] + 1 >= 10) {

digits[i] = (digits[i] + 1) % 10;

flag = 1;

if(i == 0) {

digits.insert(digits.begin(), 1);

}

} else {

digits[i] += 1;

flag = 0;

}

return digits;

}

};