day76

swolecoder · swolecoder · commit 1550f1f851c3 · 2020-12-23T09:50:40.000-05:00
diff --git a/Day76/index.js b/Day76/index.js
@@ -0,0 +1,45 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var nextGreaterElement = function(n) {
+
+    let array = n.toString().split("");
+
+    let length = array.length-1;
+
+    let dIndex = -1;
+    let d = -Infinity;
+
+    for(let i= length-1; i>=0; i--){
+        if(array[i] < array[i+1]){
+            d = array[i];
+            dIndex = i;
+            break;
+        }
+    }
+
+    //edge
+    if(dIndex == -1)return -1;
+
+    for(let i = length; i>=0; i--){
+        if(array[i] > d){
+            //swap
+            swap(array,i, dIndex);
+            break
+        }
+    }
+
+    let restofData = array.slice(dIndex+1).sort((a,b)=> a-b);
+    let res = [...array.slice(0, dIndex+1),...restofData].join("");
+
+    let max = Math.pow(2,31);
+    if(res > max || res <= n)return -1;
+    return res
+
+
+
+    function swap(array, i, j){
+        return [array[i], array[j]] = [array[j],array[i]]
+    }
+};
diff --git a/README.md b/README.md
@@ -169,3 +169,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 |Day 74| [1602. Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/) | [javascript]()|[:memo:](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/)|Medium|
 
 |Day 75| [110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [javascript]()|[:memo:](https://leetcode.com/problems/balanced-binary-tree/)|Easy|
+
+
+|Day 76| [556. Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/) | [javascript]()|[:memo:](https://leetcode.com/problems/next-greater-element-iii/)|Medium|
