Runtime: 204 ms (Top 31.03%) | Memory: 131.5 MB (Top 7.83%)

Author: AnasImloul

scripts/algorithms/N/Number of Flowers in Full Bloom/Number of Flowers in Full Bloom.java

@@ -1,13 +1,14 @@
+// Runtime: 204 ms (Top 31.03%) | Memory: 131.5 MB (Top 7.83%)
 class Solution {
 public int[] fullBloomFlowers(int[][] flowers, int[] persons) {
         int n = persons.length;
         int[] result = new int[n];
 
         TreeMap<Integer, Integer> treeMap = new TreeMap<>();
-		// See explanation here: https://leetcode.com/problems/my-calendar-iii/discuss/109556/JavaC%2B%2B-Clean-Code
+        // See explanation here: https://leetcode.com/problems/my-calendar-iii/discuss/109556/JavaC%2B%2B-Clean-Code
         for (int[] flower : flowers) {
             treeMap.put(flower[0], treeMap.getOrDefault(flower[0], 0) + 1);
-			// use end + 1 instead of end
+            // use end + 1 instead of end
             treeMap.put(flower[1] + 1, treeMap.getOrDefault(flower[1] + 1, 0) - 1);
         }
 
@@ -20,9 +21,9 @@ public int[] fullBloomFlowers(int[][] flowers, int[] persons) {
 
         for (int i = 0; i < n; i++) {
             Map.Entry<Integer, Integer> entry = sum.floorEntry(persons[i]);
-			// if entry is null then result[i] = 0
+            // if entry is null then result[i] = 0
             if (entry != null) result[i] = entry.getValue();
         }
         return result;
     }
-}
+}