From 1284b88295a87d677b242069a4b42c0867e2faba Mon Sep 17 00:00:00 2001
From: Storm_Chaser <81403270+YOGENDERSS@users.noreply.github.com>
Date: Wed, 5 Oct 2022 11:49:06 +0530
Subject: [PATCH 1/2] added plus one solution. most asked technical question

---
 LeetcodeProblems/Algorithms/plusone.java | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 LeetcodeProblems/Algorithms/plusone.java

diff --git a/LeetcodeProblems/Algorithms/plusone.java b/LeetcodeProblems/Algorithms/plusone.java
new file mode 100644
index 0000000..0136b8d
--- /dev/null
+++ b/LeetcodeProblems/Algorithms/plusone.java
@@ -0,0 +1,17 @@
+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;
+
+           }
+       digits = new int[digits.length+1];
+        digits[0] = 1;
+        return digits; 
+ 
+    }
+}
\ No newline at end of file

From 62e7901b06e48efea6ccb28463950b2ac6524ae2 Mon Sep 17 00:00:00 2001
From: Storm_Chaser <81403270+YOGENDERSS@users.noreply.github.com>
Date: Wed, 5 Oct 2022 23:19:30 +0530
Subject: [PATCH 2/2] updated the format

---
 LeetcodeProblems/Algorithms/plusone.java | 26 +++++++++---------------
 1 file changed, 10 insertions(+), 16 deletions(-)

diff --git a/LeetcodeProblems/Algorithms/plusone.java b/LeetcodeProblems/Algorithms/plusone.java
index 0136b8d..91d22e3 100644
--- a/LeetcodeProblems/Algorithms/plusone.java
+++ b/LeetcodeProblems/Algorithms/plusone.java
@@ -1,17 +1,11 @@
-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;
-
-           }
-       digits = new int[digits.length+1];
-        digits[0] = 1;
-        return digits; 
- 
+var plusOne = function(digits) {
+    result=[]; carry=1; n=digits.length-1;
+    for(i=n; i>=0; i--){
+        sum=(carry+digits[i])%10;
+        carry=Math.floor((carry+digits[i])/10); 
+        result[n]=sum;
+        n--;
     }
-}
\ No newline at end of file
+    if(carry!==0) {result.unshift(carry);} 
+    return result;
+};