# LeetCode problem [66. Plus One]

**Question :-**

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 left-to-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 = [0]

**Output:** [1]

**Explanation:** The array represents the integer 0.

Incrementing by one gives 0 + 1 = 1.

Thus, the result should be [1].

**Example 4:**

**Input:** digits = [9]

**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.

**Answer :-**

`class Solution:`

def plusOne(self, digits: List[int]) -> List[int]:

len1 = len(digits)

number = ‘’.join(map(str, digits))

number_int = int(number)

ans = number_int+1

answer = ‘’.join(str(ans))

result = [int(x) for x in str(answer)]

return result

**Approach used :-**

Firstly, I’ve taken the input list and converted it into a string then that string to an integer. After converting it into integer I’ve added 1 to it. And again formatted it in a list form and then returned the result.

# Closing Thoughts :-

I’ve solved it using this way, if you have some other interesting way then please do comment your way of solving the same problem. I’ll be very happy to check that method.

Thank you so much for reading this.

You can view the same code in GitHub also and for that Click Here.