# Plus One Leetcode Solution

In this post, we are going to solve the Plus One Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

## Problem

You are given a large integer represented as an integer array `digits`, where each `digits[i]` is the `ith` digit of the integer. The digits are ordered from most significant to least significant in leftto-right order. The large integer does not contain any leading `0`‘s.

Increment the large integer by one and return the resulting array of digits.

Example 1:

```Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Incrementing by one gives 123 + 1 = 124.
Thus, the result should be [1,2,4].
```

Example 2:

```Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
Incrementing by one gives 4321 + 1 = 4322.
Thus, the result should be [4,3,2,2].
```

Example 3:

```Input: digits = 
Output: [1,0]
Explanation: The array represents the integer 9.
Incrementing by one gives 9 + 1 = 10.
Thus, the result should be [1,0].
```

Constraints:

• `1 <= digits.length <= 100`
• `0 <= digits[i] <= 9`
• `digits` does not contain any leading `0`‘s.

Now, lets see the leetcode solution of Plus One Leetcode Solution.

### Plus One Leetcode Solution in Python

```class Solution(object):
def plusOne(self, digits):
string =""
result =[]
for d in digits:
string += str(d)
i = int(string) + 1
for w in str(i):
result.append(w)
return result```

### Plus One Leetcode Solutionin CPP

```class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int len = digits.size();
for(int i=len-1; i>=0; i--){
if(digits[i] != 9){
digits[i]+=1;
return digits;
}else{
digits[i] = 0;
}
}
vector<int> arr(len+1);
arr.insert(arr.begin(), 1);

return arr;
}
};```

### Plus One Leetcode Solution in Java

```class Solution {
public int[] plusOne(int[] digits) {
int len = digits.length;
for(int i=len-1; i>=0; i--){
if(digits[i] != 9){
digits[i]+=1;
return digits;
}else{
digits[i] = 0;
}
}
int[] arr = new int[len+1];
arr = 1;

return arr;
}
}```

Note: This problem Plus One is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purposes.

Sharing Is Caring