Added : Plus One

Author: rohitkumar-rk

LeetCode/Array/66. Plus One/Problem Statement.txt

@@ -0,0 +1,16 @@
+Given a non-empty array of digits representing a non-negative integer, increment one to the integer.
+
+The digits are stored such that the most significant digit is at the head of the list, and each element in the array contains a single digit.
+
+You may assume the integer does not contain any leading zero, except the number 0 itself.
+
+Example 1:
+
+Input: [1,2,3]
+Output: [1,2,4]
+Explanation: The array represents the integer 123.
+Example 2:
+
+Input: [4,3,2,1]
+Output: [4,3,2,2]
+Explanation: The array represents the integer 4321.

LeetCode/Array/66. Plus One/Solution.java

@@ -0,0 +1,30 @@
+/**
+
+@lc id : 66
+@problem : Plus One
+@author : github.com/rohitkumar-rk
+@date  : 06/07/2020
+@url : https://leetcode.com/problems/plus-one/
+@difficulty : easy
+*/
+
+class Solution {
+    
+    public int[] plusOne(int[] digits) {
+        
+        for(int i = digits.length -1; i >= 0; i--){
+            if(digits[i] < 9){
+                digits[i]++;
+                return digits;
+            }
+            
+            digits[i] = 0;
+        }
+        
+        //If carry has propogated to the end,
+        //First index will contain 1 and all other 0
+        int res[] = new int[digits.length+1];
+        res[0] = 1;
+        return res;
+    }
+}