100523

Author: aluferraz

src/Main.java

@@ -8,11 +8,13 @@
 import leetcode.editor.en.Q2466.CountWaysToBuildGoodStrings;
 import leetcode.editor.en.Q311.SparseMatrixMultiplication;
 import leetcode.editor.en.Q354.RussianDollEnvelopes;
+import leetcode.editor.en.Q376.WiggleSubsequence;
 import leetcode.editor.en.Q377.CombinationSumIv;
 import leetcode.editor.en.Q474.OnesAndZeroes;
 import leetcode.editor.en.Q518.CoinChangeII;
 import leetcode.editor.en.Q54.SpiralMatrix;
 import leetcode.editor.en.Q649.Dota2Senate;
+import leetcode.editor.en.Q651.FourKeysKeyboard;
 import leetcode.editor.en.Q91.DecodeWays;
 import org.json.JSONArray;
 import org.json.JSONTokener;
@@ -27,7 +29,7 @@
 
 public class Main {
     public static void main(String[] args) throws IOException {
-        System.out.println(new CountVowelsPermutation().countVowelPermutation(2));
+        System.out.println(new FourKeysKeyboard().maxA(9));
 
     }
 

src/leetcode/editor/en/Q376/WiggleSubsequence.java

@@ -0,0 +1,81 @@
+package leetcode.editor.en.Q376;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    private static final int LESSER = 0;
+    private static final int GREATER = 1;
+
+    private Integer[][] cache;
+
+    public int wiggleMaxLength(int[] nums) {
+        int[] NGE = nextGreaterElement(nums);
+        int[] NLE = nextLesserElement(nums);
+        cache = new Integer[nums.length][2];
+
+        int ans = 0;
+        for (int i = 0; i < nums.length; i++) {
+            ans = Math.max(wiggleMaxLength(i, GREATER, NGE, NLE), ans);
+            ans = Math.max(wiggleMaxLength(i, LESSER, NGE, NLE), ans);
+        }
+        return ans;
+
+    }
+
+    private int wiggleMaxLength(int i, int direction, int[] NGE, int[] NLE) {
+        if (i == NGE.length) {
+            return 0;
+        }
+        if (cache[i][direction] != null) {
+            return cache[i][direction];
+        }
+
+        int ans = 0;
+        int greaterDir = 0;
+        int lesserDir = 0;
+        if (direction == GREATER) {
+            greaterDir = 1 + wiggleMaxLength(NGE[i], LESSER, NGE, NLE);
+            ans = greaterDir;
+        } else {
+            lesserDir = 1 + wiggleMaxLength(NLE[i], GREATER, NGE, NLE);
+            ans = lesserDir;
+        }
+        cache[i][direction] = ans;
+        return ans;
+    }
+
+
+    private int[] nextGreaterElement(int[] nums) {
+        int[] NGE = new int[nums.length];
+        Arrays.fill(NGE, nums.length);
+        LinkedList<Integer> stack = new LinkedList<>();
+        for (int i = 0; i < nums.length; i++) {
+            while (!stack.isEmpty() && nums[stack.peekLast()] < nums[i]) {
+                NGE[stack.pop()] = i;
+            }
+            stack.add(i);
+        }
+        return NGE;
+    }
+
+    private int[] nextLesserElement(int[] nums) {
+        int[] NLE = new int[nums.length];
+        Arrays.fill(NLE, nums.length);
+        LinkedList<Integer> stack = new LinkedList<>();
+        for (int i = 0; i < nums.length; i++) {
+            while (!stack.isEmpty() && nums[i] < nums[stack.peekLast()]) {
+                NLE[stack.pop()] = i;
+            }
+            stack.add(i);
+        }
+        return NLE;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class WiggleSubsequence extends Solution {
+}

src/leetcode/editor/en/Q651/FourKeysKeyboard.java

@@ -0,0 +1,32 @@
+package leetcode.editor.en.Q651;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+
+
+    public int maxA(int n) {
+
+    }
+
+    public int maxAHelper(int n) {
+        if (n == 0) {
+            return 0;
+        }
+        int ans = 0;
+        int bufferToDouble = maxAHelper(n - 3);
+        if (n >= 3) {
+
+        }
+    }
+
+
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class FourKeysKeyboard extends Solution {
+}