The Plus One solutions are below.
15 Jun 2024•Easy•C++ / Python / TypeScript
Plus One
C++, Python and TypeScript solutions for Plus One.
Solution files
Python•plus-one/synced-solution.py
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
for i in range(len(digits)-1, -1, -1):
if digits[i] < 9:
digits[i] += 1
return digits
digits[i] = 0
return [1] + digits
C++•plus-one/synced-solution.cpp
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
for (int i = digits.size()-1; i >= 0; i--) {
if (digits[i] < 9) { digits[i]++; return digits; }
digits[i] = 0;
}
digits.insert(digits.begin(), 1);
return digits;
}
};
TypeScript•plus-one/synced-solution.ts
function plusOne(digits: number[]): number[] {
for (let i = digits.length - 1; i >= 0; i--) {
if (digits[i] < 9) { digits[i]++; return digits; }
digits[i] = 0;
}
return [1, ...digits];
}