style: format code and documents

Author: yanglbme

lcof/面试题09. 用两个栈实现队列/README.md

@@ -299,11 +299,11 @@ public class CQueue {
         stack1 = new Stack<int>();
         stack2 = new Stack<int>();
     }
-    
+
     public void AppendTail(int value) {
         stack1.Push(value);
     }
-    
+
     public int DeleteHead() {
         if (stack2.Count == 0) {
             while (stack1.Count != 0) {
@@ -327,4 +327,5 @@ public class CQueue {
 ```
 
 ```
+
 <!-- tabs:end -->

lcof/面试题11. 旋转数组的最小数字/README.md

@@ -175,4 +175,5 @@ public class Solution {
 ```
 
 ```
+
 <!-- tabs:end -->

lcof/面试题12. 矩阵中的路径/README.md

@@ -298,7 +298,7 @@ public class Solution {
             {
                 if (dfs(board, word, i, j, k)) {
                     return true;
-                }   
+                }
             }
         }
         return false;

lcof/面试题19. 正则表达式匹配/README.md

@@ -237,7 +237,7 @@ public class Solution {
         for(int j = 1; j < n + 1; j++) {
             if (p[j-1] == '*') {
                 dp[0,j] = dp[0,j-2];
-            } 
+            }
         }
         for (int i = 1; i < m + 1; i++) {
             for (int j = 1; j < n + 1; j++) {

lcof/面试题26. 树的子结构/README.md

@@ -289,7 +289,7 @@ public class Solution {
             return false;
         }
         return dfs(A, B) || IsSubStructure(A.left, B) || IsSubStructure(A.right, B);
-    } 
+    }
 
     public bool dfs(TreeNode A, TreeNode B) {
         if (B == null) {

lcof/面试题28. 对称的二叉树/README.md

@@ -290,7 +290,7 @@ public class Solution {
         if (left == null || right == null || left.val != right.val) {
             return false;
         }
-        return dfs(left.left, right.right) && dfs(left.right, right.left); 
+        return dfs(left.left, right.right) && dfs(left.right, right.left);
     }
 }
 ```

lcof/面试题29. 顺时针打印矩阵/README.md

@@ -197,7 +197,7 @@ public class Solution {
             }
             for (int i = bottom; i >= top; i--) {
                 ans.Add(matrix[i][left]);
-            } 
+            }
             left += 1;
             if (left > right) {
                 break;

lcof/面试题30. 包含min函数的栈/README.md

@@ -283,21 +283,21 @@ public class MinStack {
         minStack = new Stack<int>();
         minStack.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stack.Push(x);
         minStack.Push(Math.Min(minStack.Peek(), x));
     }
-    
+
     public void Pop() {
         stack.Pop();
         minStack.Pop();
     }
-    
+
     public int Top() {
         return stack.Peek();
     }
-    
+
     public int Min() {
         return minStack.Peek();
     }

lcof/面试题33. 二叉搜索树的后序遍历序列/README.md

@@ -225,6 +225,7 @@ impl Solution {
 ```
 
 ### **C#**
+
 ```cs
 public class Solution {
     public bool VerifyPostorder(int[] postorder) {

lcof/面试题37. 序列化二叉树/README.md

@@ -323,18 +323,18 @@ public class Codec {
         }
         return str;
     }
-  
+
     public TreeNode rdeserialize(LinkedList<string> dataList) {
         if (dataList.First.Value.Equals("None")) {
             dataList.RemoveFirst();
             return null;
         }
-  
+
         TreeNode root = new TreeNode(int.Parse(dataList.First.Value));
         dataList.RemoveFirst();
         root.left = rdeserialize(dataList);
         root.right = rdeserialize(dataList);
-    
+
         return root;
     }
 }