Skip to content

Files

Latest commit

ee86d69 · Jun 6, 2024

History

History
19 lines (14 loc) · 921 Bytes

Day29_LeetCode66.md

File metadata and controls

19 lines (14 loc) · 921 Bytes

Day 29: LeetCode 66 [Plus One]

Problem Description: 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].

Link to LeetCode Problem: https://leetcode.com/problems/plus-one/description/

so like if last digit is less than 9 then no problem will simply add one in last number and return and if it is 9 then will keep forwarding carry

image