day 8 complate with array

GameOfCode64 · GameOfCode64 · commit cbf3bf6840f8 · 2024-07-21T16:46:10.000+05:30
diff --git a/Array/day7.js b/Array/day7.js
@@ -5,7 +5,6 @@
 // * Q5, Search Insert Position
 // * Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
 // * You must write an algorithm with O(log n) runtime complexity
-
 // * Input: nums = [1,3,5,6], target = 5 , Output: 2
 // * Input: nums = [1,3,5,6], target = 2 , Output: 1
 
diff --git a/Array/day8.js b/Array/day8.js
@@ -0,0 +1,41 @@
+// ! DSA in JavaScript day 5
+
+// Todo: Topic Array
+
+// * Q6, Plus One
+
+// * 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.
+
+// * Input: digits = [1,2,3], [4,3,2,1], [9]
+// * 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].
+
+// Todo: My Answer (Wrong Answer)
+function plusOne1(integer) {
+  if (integer.length - 1 !== 9) {
+    let num = "";
+    for (let i = 0; i < integer.length; i++) {
+      num += integer[i];
+    }
+    num = parseInt(num);
+    return num + 1;
+  }
+}
+
+console.log(plusOne1([9]));
+console.clear();
+
+function plusOne(digits) {
+  for (let i = digits.length - 1; i >= 0; i--) {
+    if (digits[i] < 9) {
+      digits[i]++;
+      return digits;
+    }
+    digits[i] = 0;
+  }
+  digits.unshift(1);
+  return digits;
+}
+console.log(plusOne([1, 2, 3]));
diff --git a/Array/tempCodeRunnerFile.js b/Array/tempCodeRunnerFile.js
@@ -0,0 +1 @@
+mango
