LeetCode——加一
阿新 • • 發佈:2018-12-30
vector<int> plusOne(vector<int>& digits) { int length = digits.size(); int focus = length - 1; digits[focus] += 1; while(digits[focus] == 10 & focus > 0) //focus位是否進位 { digits[focus] = 0; focus--; digits[focus] += 1; } if(digits[0] != 10) //0位是否為10 //if(digits[focus] != 10) //邏輯相同 更快 return digits; else //對應所有數值均為9.如[9,9,9,9] { vector<int> num{1}; while(length--) num.push_back(0); return num; } }