style: format code using clang-format

Author: yanglbme

Diff for: .clang-format

@@ -1,3 +1,142 @@
+---
+Language: Java
+AccessModifierOffset: -4
+AlignAfterOpenBracket: DontAlign
+AlignConsecutiveMacros: false
+AlignConsecutiveAssignments: false
+AlignConsecutiveDeclarations: false
+AlignEscapedNewlines: Right
+AlignOperands:   false
+AlignTrailingComments: false
+AllowAllArgumentsOnNextLine: true
+AllowAllConstructorInitializersOnNextLine: true
+AllowAllParametersOfDeclarationOnNextLine: true
+AllowShortBlocksOnASingleLine: Never
+AllowShortCaseLabelsOnASingleLine: false
+AllowShortFunctionsOnASingleLine: false
+AllowShortLambdasOnASingleLine: All
+AllowShortIfStatementsOnASingleLine: true
+AllowShortLoopsOnASingleLine: true
+AlwaysBreakAfterDefinitionReturnType: None
+AlwaysBreakAfterReturnType: TopLevelDefinitions
+AlwaysBreakBeforeMultilineStrings: false
+AlwaysBreakTemplateDeclarations: MultiLine
+BinPackArguments: true
+BinPackParameters: true
+BraceWrapping:
+  AfterCaseLabel:  false
+  AfterClass:      false
+  AfterControlStatement: false
+  AfterEnum:       false
+  AfterFunction:   false
+  AfterNamespace:  false
+  AfterObjCDeclaration: false
+  AfterStruct:     false
+  AfterUnion:      false
+  AfterExternBlock: false
+  BeforeCatch:     false
+  BeforeElse:      false
+  IndentBraces:    false
+  SplitEmptyFunction: true
+  SplitEmptyRecord: true
+  SplitEmptyNamespace: true
+BreakBeforeBinaryOperators: All
+BreakBeforeBraces: Custom
+BreakBeforeInheritanceComma: false
+BreakInheritanceList: BeforeColon
+BreakBeforeTernaryOperators: true
+BreakConstructorInitializersBeforeComma: false
+BreakConstructorInitializers: BeforeComma
+BreakAfterJavaFieldAnnotations: false
+BreakStringLiterals: true
+ColumnLimit:     100
+CommentPragmas:  '^ IWYU pragma:'
+CompactNamespaces: false
+ConstructorInitializerAllOnOneLineOrOnePerLine: false
+ConstructorInitializerIndentWidth: 4
+ContinuationIndentWidth: 4
+Cpp11BracedListStyle: true
+DeriveLineEnding: true
+DerivePointerAlignment: false
+DisableFormat:   false
+ExperimentalAutoDetectBinPacking: false
+FixNamespaceComments: false
+ForEachMacros:
+  - foreach
+  - Q_FOREACH
+  - BOOST_FOREACH
+IncludeBlocks:   Preserve
+IncludeCategories:
+  - Regex:           '^"(llvm|llvm-c|clang|clang-c)/'
+    Priority:        2
+    SortPriority:    0
+  - Regex:           '^(<|"(gtest|gmock|isl|json)/)'
+    Priority:        3
+    SortPriority:    0
+  - Regex:           '.*'
+    Priority:        1
+    SortPriority:    0
+IncludeIsMainRegex: '(Test)?$'
+IncludeIsMainSourceRegex: ''
+IndentCaseLabels: false
+IndentGotoLabels: true
+IndentPPDirectives: None
+IndentWidth:     4
+IndentWrappedFunctionNames: false
+JavaScriptQuotes: Leave
+JavaScriptWrapImports: true
+KeepEmptyLinesAtTheStartOfBlocks: true
+MacroBlockBegin: ''
+MacroBlockEnd:   ''
+MaxEmptyLinesToKeep: 1
+NamespaceIndentation: Inner
+ObjCBinPackProtocolList: Auto
+ObjCBlockIndentWidth: 4
+ObjCSpaceAfterProperty: true
+ObjCSpaceBeforeProtocolList: true
+PenaltyBreakAssignment: 2
+PenaltyBreakBeforeFirstCallParameter: 19
+PenaltyBreakComment: 300
+PenaltyBreakFirstLessLess: 120
+PenaltyBreakString: 1000
+PenaltyBreakTemplateDeclaration: 10
+PenaltyExcessCharacter: 1000000
+PenaltyReturnTypeOnItsOwnLine: 60
+PointerAlignment: Left
+ReflowComments:  true
+SortIncludes:    true
+SortUsingDeclarations: true
+SpaceAfterCStyleCast: true
+SpaceAfterLogicalNot: false
+SpaceAfterTemplateKeyword: true
+SpaceBeforeAssignmentOperators: true
+SpaceBeforeCpp11BracedList: false
+SpaceBeforeCtorInitializerColon: true
+SpaceBeforeInheritanceColon: true
+SpaceBeforeParens: ControlStatements
+SpaceBeforeRangeBasedForLoopColon: true
+SpaceInEmptyBlock: false
+SpaceInEmptyParentheses: false
+SpacesBeforeTrailingComments: 1
+SpacesInAngles:  false
+SpacesInConditionalStatement: false
+SpacesInContainerLiterals: false
+SpacesInCStyleCastParentheses: false
+SpacesInParentheses: false
+SpacesInSquareBrackets: false
+SpaceBeforeSquareBrackets: false
+Standard:        Latest
+StatementMacros:
+  - Q_UNUSED
+  - QT_REQUIRE_VERSION
+TabWidth:        8
+UseCRLF:         false
+UseTab:          Never
+...
+
+
+
+
 ---
 Language:        Cpp
 # BasedOnStyle:  WebKit
@@ -107,21 +246,21 @@ PointerAlignment: Left
 ReflowComments:  true
 SortIncludes:    true
 SortUsingDeclarations: true
-SpaceAfterCStyleCast: false
+SpaceAfterCStyleCast: true
 SpaceAfterLogicalNot: false
 SpaceAfterTemplateKeyword: true
 SpaceBeforeAssignmentOperators: true
-SpaceBeforeCpp11BracedList: true
+SpaceBeforeCpp11BracedList: false
 SpaceBeforeCtorInitializerColon: true
 SpaceBeforeInheritanceColon: true
 SpaceBeforeParens: ControlStatements
 SpaceBeforeRangeBasedForLoopColon: true
-SpaceInEmptyBlock: true
+SpaceInEmptyBlock: false
 SpaceInEmptyParentheses: false
 SpacesBeforeTrailingComments: 1
 SpacesInAngles:  false
 SpacesInConditionalStatement: false
-SpacesInContainerLiterals: true
+SpacesInContainerLiterals: false
 SpacesInCStyleCastParentheses: false
 SpacesInParentheses: false
 SpacesInSquareBrackets: false

Diff for: basic/sorting/CountingSort/CountingSort.java

@@ -1,4 +1,5 @@
-public static void sort(int[] nums, int min, int max) {
+public static void
+sort(int[] nums, int min, int max) {
     int n = nums.length;
     int k = max - min + 1;
     int[] c = new int[k];

Diff for: basic/sorting/HeapSort/Main.java

@@ -3,7 +3,7 @@
 public class Main {
     private static int[] h = new int[100010];
     private static int size;
-    
+
     public static void main(String[] args) {
         Scanner sc = new Scanner(System.in);
         int n = sc.nextInt(), m = sc.nextInt();
@@ -20,7 +20,7 @@ public static void main(String[] args) {
             down(1);
         }
     }
-    
+
     public static void down(int u) {
         int t = u;
         if (u * 2 <= size && h[u * 2] < h[t]) {
@@ -34,14 +34,14 @@ public static void down(int u) {
             down(t);
         }
     }
-    
+
     public static void up(int u) {
         while (u / 2 > 0 && h[u / 2] > h[u]) {
             swap(u / 2, u);
             u /= 2;
         }
     }
-    
+
     public static void swap(int i, int j) {
         int t = h[i];
         h[i] = h[j];

Diff for: basic/sorting/InsertionSort/InsertionSort.java

@@ -5,7 +5,7 @@ public class InsertionSort {
     private static void insertionSort(int[] nums) {
         for (int i = 1, j, n = nums.length; i < n; ++i) {
             int num = nums[i];
-            for (j = i - 1; j >=0 && nums[j] > num; --j) {
+            for (j = i - 1; j >= 0 && nums[j] > num; --j) {
                 nums[j + 1] = nums[j];
             }
             nums[j + 1] = num;

Diff for: basic/sorting/MergeSort/Main.java

@@ -2,7 +2,7 @@
 
 public class Main {
     private static int[] tmp = new int[100010];
-    
+
     public static void main(String[] args) {
         Scanner sc = new Scanner(System.in);
         int n = sc.nextInt();
@@ -15,7 +15,7 @@ public static void main(String[] args) {
             System.out.print(x + " ");
         }
     }
-    
+
     public static void mergeSort(int[] nums, int left, int right) {
         if (left >= right) {
             return;
@@ -30,7 +30,6 @@ public static void mergeSort(int[] nums, int left, int right) {
             } else {
                 tmp[k++] = nums[j++];
             }
-            
         }
         while (i <= mid) {
             tmp[k++] = nums[i++];

Diff for: basic/sorting/QuickSort/Main.java

@@ -13,16 +13,18 @@ public static void main(String[] args) {
             System.out.print(nums[i] + " ");
         }
     }
-    
+
     public static void quickSort(int[] nums, int left, int right) {
         if (left >= right) {
             return;
         }
         int i = left - 1, j = right + 1;
         int x = nums[(left + right) >> 1];
         while (i < j) {
-            while (nums[++i] < x);
-            while (nums[--j] > x);
+            while (nums[++i] < x)
+                ;
+            while (nums[--j] > x)
+                ;
             if (i < j) {
                 int t = nums[i];
                 nums[i] = nums[j];

Diff for: basic/sorting/ShellSort/ShellSort.java

@@ -20,6 +20,6 @@ private static int[] shellSort(int[] arr) {
     }
 
     public static void main(String[] args) {
-        System.out.println(Arrays.toString(shellSort(new int[]{1, 2, 7, 9, 5, 8})));
+        System.out.println(Arrays.toString(shellSort(new int[] {1, 2, 7, 9, 5, 8})));
     }
 }

Diff for: lcci/03.02.Min Stack/Solution.java

@@ -8,21 +8,21 @@ public MinStack() {
         mins = new ArrayDeque<>();
         mins.push(Integer.MAX_VALUE);
     }
-    
+
     public void push(int val) {
         s.push(val);
         mins.push(Math.min(mins.peek(), val));
     }
-    
+
     public void pop() {
         s.pop();
         mins.pop();
     }
-    
+
     public int top() {
         return s.peek();
     }
-    
+
     public int getMin() {
         return mins.peek();
     }

Diff for: lcci/03.04.Implement Queue using Stacks/Solution.java

@@ -7,12 +7,12 @@ public MyQueue() {
         s1 = new Stack<>();
         s2 = new Stack<>();
     }
-    
+
     /** Push element x to the back of queue. */
     public void push(int x) {
         s1.push(x);
     }
-    
+
     /** Removes the element from in front of queue and returns that element. */
     public int pop() {
         if (s2.empty()) {
@@ -22,7 +22,7 @@ public int pop() {
         }
         return s2.pop();
     }
-    
+
     /** Get the front element. */
     public int peek() {
         if (s2.empty()) {
@@ -32,7 +32,7 @@ public int peek() {
         }
         return s2.peek();
     }
-    
+
     /** Returns whether the queue is empty. */
     public boolean empty() {
         return s1.empty() && s2.empty();

Diff for: lcci/03.05.Sort of Stacks/Solution.java

@@ -3,7 +3,7 @@ class SortedStack {
     public SortedStack() {
         s = new Stack<>();
     }
-    
+
     public void push(int val) {
         Stack<Integer> t = new Stack<>();
         while (!isEmpty() && s.peek() < val) {
@@ -14,17 +14,17 @@ public void push(int val) {
             s.push(t.pop());
         }
     }
-    
+
     public void pop() {
         if (!isEmpty()) {
             s.pop();
         }
     }
-    
+
     public int peek() {
         return isEmpty() ? -1 : s.peek();
     }
-    
+
     public boolean isEmpty() {
         return s.isEmpty();
     }