Improved task 1029.

javadev · web-flow · commit 278c2c6b418e · 2022-02-27T16:26:53.000+02:00
diff --git a/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java b/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java
@@ -1,6 +1,7 @@
 package g1001_1100.s1004_max_consecutive_ones_iii;
 
 // #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window
+// #2022_02_27_Time_3_ms_(79.01%)_Space_68.2_MB_(65.91%)
 
 public class Solution {
     public int longestOnes(int[] a, int k) {
diff --git a/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java b/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java
@@ -1,6 +1,6 @@
 package g1001_1100.s1029_two_city_scheduling;
 
-// #Medium #Array #Sorting #Greedy
+// #Medium #Array #Sorting #Greedy #2022_02_27_Time_1_ms_(97.54%)_Space_39.9_MB_(53.65%)
 
 import java.util.Arrays;
 
