Classic 150 Interview Questions P66 Plus One

---

Timeline

Timeline

2025-11-26

init

Math

---

Problem:

P66 Plus One

https://leetcode.cn/problems/plus-one/description/?envType=study-plan-v2&envId=top-interview-150

High-precision Plus One

#include <vector>
using std::vector;

class Solution {
    public:
	vector<int> plusOne(vector<int> &digits)
	{
		int i, n = digits.size();
		int carry = 1, sum;
		for (i = n - 1; i >= 0; i--) {
			if (carry == 0) {
				break;
			}
			sum = digits[i] + carry;
			digits[i] = sum % 10;
			carry = sum / 10;
		}
		if (carry == 1) {
			digits.insert(digits.begin(), 1);
		}
		return digits;
	}
};