solves plus one

Author: anishLearnsToCode

Diff for: README.md

@@ -25,7 +25,7 @@
 | 35 | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/SearchInsertPosition.java) |
 | 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/CountAndSay.java) |
 | 53 | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/MaximumSubArray.java) |
-| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | Easy | |
+| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/LengthOfLastWord.java) |
 | 66 | [Plus One](https://leetcode.com/problems/plus-one) | Easy | |
 | 67 | [Add Binary](https://leetcode.com/problems/add-binary) | Easy | |
 | 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | Easy | |

Diff for: src/PlusOne.java

@@ -0,0 +1,26 @@
+import java.util.Arrays;
+import java.util.Scanner;
+import java.util.Stack;
+
+public class PlusOne {
+    public static int[] plusOne(int[] digits) {
+        Stack<Integer> numbers = new Stack<>();
+        int carry = 0;
+        for (int index = digits.length - 1, factor = 1 ; index >= 0 ; index--) {
+            int value = digits[index] + factor + carry;
+            numbers.push(value % 10);
+            carry = value / 10;
+            factor = 0;
+        }
+        if (carry > 0) {
+            numbers.push(carry);
+        }
+
+        int[] result = new int[numbers.size()];
+        int index = 0;
+        while (!numbers.isEmpty()) {
+            result[index++] = numbers.pop();
+        }
+        return result;
+    }
+}