style: format code and document

Author: yanglbme

lcci/17.08.Circus Tower/README.md

@@ -105,7 +105,7 @@ class Solution {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

lcci/17.08.Circus Tower/README_EN.md

@@ -94,7 +94,7 @@ class Solution {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

lcci/17.08.Circus Tower/Solution.java

@@ -29,7 +29,7 @@ public int bestSeqAtIndex(int[] height, int[] weight) {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

solution/0400-0499/0480.Sliding Window Median/README.md

@@ -219,7 +219,6 @@ class MedianFinder {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

solution/0400-0499/0480.Sliding Window Median/README_EN.md

@@ -191,7 +191,6 @@ class MedianFinder {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

solution/0400-0499/0480.Sliding Window Median/Solution.cpp

@@ -43,7 +43,7 @@ class MedianFinder {
     int largeSize = 0;
     int k;
 
-    template<typename T>
+    template <typename T>
     void prune(T& pq) {
         while (!pq.empty() && delayed[pq.top()]) {
             if (--delayed[pq.top()] == 0) {

solution/0400-0499/0480.Sliding Window Median/Solution.java

@@ -65,7 +65,6 @@ private void rebalance() {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

solution/0500-0599/0514.Freedom Trail/README.md

@@ -121,7 +121,8 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key.charAt(i) - 'a']) {
                 for (int k : pos[key.charAt(i - 1) - 'a']) {
-                    f[i][j] = Math.min(f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
+                    f[i][j] = Math.min(
+                        f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
                 }
             }
         }

solution/0500-0599/0514.Freedom Trail/README_EN.md

@@ -93,7 +93,8 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key.charAt(i) - 'a']) {
                 for (int k : pos[key.charAt(i - 1) - 'a']) {
-                    f[i][j] = Math.min(f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
+                    f[i][j] = Math.min(
+                        f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
                 }
             }
         }

solution/0500-0599/0514.Freedom Trail/Solution.cpp

@@ -14,7 +14,7 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key[i] - 'a']) {
                 for (int k : pos[key[i - 1] - 'a']) {
-                    f[i][j] = min(f[i][j], f[i - 1][k] + min(abs(j - k), n - abs(j -  k)) + 1);
+                    f[i][j] = min(f[i][j], f[i - 1][k] + min(abs(j - k), n - abs(j - k)) + 1);
                 }
             }
         }