Added exec time 913-920.

Author: javadev

src.save/main/java/g0901_1000/s0913_cat_and_mouse/Solution.java

@@ -1,6 +1,7 @@
 package g0901_1000.s0913_cat_and_mouse;
 
 // #Hard #Dynamic_Programming #Math #Breadth_First_Search #Graph #Memoization #Game_Theory
+// #2022_03_29_Time_16_ms_(97.20%)_Space_47_MB_(78.40%)
 
 import java.util.LinkedList;
 import java.util.Queue;

src.save/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java

@@ -1,6 +1,7 @@
 package g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards;
 
 // #Easy #Array #Hash_Table #Math #Counting #Number_Theory
+// #2022_03_29_Time_16_ms_(19.29%)_Space_52.2_MB_(35.81%)
 
 import java.util.HashMap;
 import java.util.Map;

src.save/main/java/g0901_1000/s0915_partition_array_into_disjoint_intervals/Solution.java

@@ -1,16 +1,20 @@
 package g0901_1000.s0915_partition_array_into_disjoint_intervals;
 
-// #Medium #Array
+// #Medium #Array #2022_03_29_Time_2_ms_(99.81%)_Space_96.1_MB_(47.60%)
 
 public class Solution {
     public int partitionDisjoint(int[] nums) {
-        int partition = 0;
+        int res = 0;
+        int leftMax = nums[0];
+        int greater = nums[0];
         for (int i = 1; i < nums.length; i++) {
-            int currentMax = nums[0];
-            if (nums[i] < currentMax) {
-                partition = i;
+            if (greater <= nums[i]) {
+                greater = nums[i];
+            } else if (nums[i] < leftMax) {
+                res = i;
+                leftMax = greater;
             }
         }
-        return partition + 1;
+        return res + 1;
     }
 }

src.save/main/java/g0901_1000/s0916_word_subsets/Solution.java

@@ -1,6 +1,6 @@
 package g0901_1000.s0916_word_subsets;
 
-// #Medium #Array #String #Hash_Table
+// #Medium #Array #String #Hash_Table #2022_03_29_Time_30_ms_(57.30%)_Space_88_MB_(54.80%)
 
 import java.util.ArrayList;
 import java.util.List;

src.save/main/java/g0901_1000/s0917_reverse_only_letters/Solution.java

@@ -1,6 +1,6 @@
 package g0901_1000.s0917_reverse_only_letters;
 
-// #Easy #String #Two_Pointers
+// #Easy #String #Two_Pointers #2022_03_29_Time_0_ms_(100.00%)_Space_39.9_MB_(99.08%)
 
 public class Solution {
     public String reverseOnlyLetters(String s) {

src.save/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.java

@@ -1,6 +1,7 @@
 package g0901_1000.s0918_maximum_sum_circular_subarray;
 
 // #Medium #Array #Dynamic_Programming #Divide_and_Conquer #Queue #Monotonic_Queue
+// #Dynamic_Programming_I_Day_5 #2022_03_29_Time_3_ms_(92.86%)_Space_64.3_MB_(40.27%)
 
 public class Solution {
     private int kadane(int[] nums, int sign) {

src.save/main/java/g0901_1000/s0919_complete_binary_tree_inserter/CBTInserter.java

@@ -1,12 +1,28 @@
 package g0901_1000.s0919_complete_binary_tree_inserter;
 
 // #Medium #Breadth_First_Search #Tree #Binary_Tree #Design
+// #2022_03_29_Time_11_ms_(96.06%)_Space_42.7_MB_(92.12%)
 
 import com_github_leetcode.TreeNode;
 import java.util.LinkedList;
 import java.util.Objects;
 import java.util.Queue;
 
+/*
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
 public class CBTInserter {
     private final Queue<TreeNode> q;
     private final TreeNode head;
@@ -59,7 +75,15 @@ private void deleteFullNode() {
         }
     }
 
+    // get_root()
     public TreeNode getRoot() {
         return this.head;
     }
 }
+
+/*
+ * Your CBTInserter object will be instantiated and called as such:
+ * CBTInserter obj = new CBTInserter(root);
+ * int param_1 = obj.insert(val);
+ * TreeNode param_2 = obj.get_root();
+ */

src.save/main/java/g0901_1000/s0920_number_of_music_playlists/Solution.java

@@ -1,6 +1,7 @@
 package g0901_1000.s0920_number_of_music_playlists;
 
 // #Hard #Dynamic_Programming #Math #Combinatorics
+// #2022_03_29_Time_2_ms_(96.55%)_Space_43.2_MB_(25.12%)
 
 import java.util.Arrays;