Merge branch 'doocs:main' into main

Author: caohonghai

images/starcharts.svg

@@ -3,8 +3,9 @@ class Solution {
     bool CheckPermutation(string s1, string s2) {
         if (s1.size() != s2.size()) return false;
         int cnt[26] = {0};
-        for (char & c : s1) ++cnt[c - 'a'];
-        for (char & c : s2) if (--cnt[c - 'a'] < 0) return false;
+        for (char& c : s1) ++cnt[c - 'a'];
+        for (char& c : s2)
+            if (--cnt[c - 'a'] < 0) return false;
         return true;
     }
 };

lcci/01.02.Check Permutation/Solution.cpp

@@ -1,6 +1,6 @@
 class Solution {
     public boolean canPermutePalindrome(String s) {
-        Map<Character, Integer> cnt =  new HashMap<>();
+        Map<Character, Integer> cnt = new HashMap<>();
         for (int i = 0; i < s.length(); ++i) {
             cnt.merge(s.charAt(i), 1, Integer::sum);
         }

lcci/01.04.Palindrome Permutation/Solution.java

@@ -1,4 +1,4 @@
-void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
+void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
     int m = matrixSize;
     int n = matrixColSize[0];
     int l0 = 0;

lcci/01.08.Zero Matrix/Solution.c

@@ -6,21 +6,21 @@ class MinStack {
     public MinStack() {
         stk2.push(Integer.MAX_VALUE);
     }
-    
+
     public void push(int x) {
         stk1.push(x);
         stk2.push(Math.min(x, stk2.peek()));
     }
-    
+
     public void pop() {
         stk1.pop();
         stk2.pop();
     }
-    
+
     public int top() {
         return stk1.peek();
     }
-    
+
     public int getMin() {
         return stk2.peek();
     }

lcci/03.02.Min Stack/Solution.java

@@ -5,7 +5,7 @@ class StackOfPlates {
     public StackOfPlates(int cap) {
         this.cap = cap;
     }
-    
+
     public void push(int val) {
         if (cap == 0) {
             return;
@@ -15,11 +15,11 @@ public void push(int val) {
         }
         stk.get(stk.size() - 1).push(val);
     }
-    
+
     public int pop() {
         return popAt(stk.size() - 1);
     }
-    
+
     public int popAt(int index) {
         int ans = -1;
         if (index >= 0 && index < stk.size()) {

lcci/03.03.Stack of Plates/Solution.java

@@ -13,7 +13,8 @@ public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
     }
 
     private void dfs(int i, int j) {
-        if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc || image[i][j] == nc) {
+        if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc
+            || image[i][j] == nc) {
             return;
         }
         image[i][j] = nc;

lcci/08.10.Color Fill/Solution.java

@@ -71,7 +71,7 @@ class WordsFrequency {
             cnt.merge(x, 1, Integer::sum);
         }
     }
-    
+
     public int get(String word) {
         return cnt.getOrDefault(word, 0);
     }
@@ -94,7 +94,7 @@ public:
             ++cnt[x];
         }
     }
-    
+
     int get(string word) {
         return cnt[word];
     }

lcci/16.02.Words Frequency/README_EN.md

@@ -5,7 +5,7 @@ class WordsFrequency {
             ++cnt[x];
         }
     }
-    
+
     int get(string word) {
         return cnt[word];
     }

lcci/16.02.Words Frequency/Solution.cpp

@@ -6,7 +6,7 @@ public WordsFrequency(String[] book) {
             cnt.merge(x, 1, Integer::sum);
         }
     }
-    
+
     public int get(String word) {
         return cnt.getOrDefault(word, 0);
     }