style: prettify code

Author: yanglbme

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

@@ -72,21 +72,21 @@ class MinStack {
         s1 = new ArrayDeque<>();
         s2 = new ArrayDeque<>();
     }
-    
+
     public void push(int x) {
         s1.push(x);
         s2.push(s2.isEmpty() || s2.peek() >= x ? x : s2.peek());
     }
-    
+
     public void pop() {
         s1.pop();
         s2.pop();
     }
-    
+
     public int top() {
         return s1.peek();
     }
-    
+
     public int min() {
         return s2.peek();
     }

lcof/面试题31. 栈的压入、弹出序列/README.md

@@ -84,17 +84,17 @@ class Solution {
  * @param {number[]} popped
  * @return {boolean}
  */
-var validateStackSequences = function(pushed, popped) {
-    let s = [];
-    let q = 0;
-    for (let num of pushed) {
-        s.push(num);
-        while (s.length > 0 && s[s.length - 1] == popped[q]) {
-            ++q;
-            s.pop();
-        }
+var validateStackSequences = function (pushed, popped) {
+  let s = [];
+  let q = 0;
+  for (let num of pushed) {
+    s.push(num);
+    while (s.length > 0 && s[s.length - 1] == popped[q]) {
+      ++q;
+      s.pop();
     }
-    return s.length == 0;
+  }
+  return s.length == 0;
 };
 ```
 

lcof/面试题31. 栈的压入、弹出序列/Solution.js

@@ -3,15 +3,15 @@
  * @param {number[]} popped
  * @return {boolean}
  */
-var validateStackSequences = function(pushed, popped) {
+var validateStackSequences = function (pushed, popped) {
   let s = [];
   let q = 0;
   for (let num of pushed) {
-      s.push(num);
-      while (s.length > 0 && s[s.length - 1] == popped[q]) {
-          ++q;
-          s.pop();
-      }
+    s.push(num);
+    while (s.length > 0 && s[s.length - 1] == popped[q]) {
+      ++q;
+      s.pop();
+    }
   }
   return s.length == 0;
-};
+};