init commit

Author: 92hackers

.gitignore

@@ -0,0 +1 @@
+*.swp

avl_tree.js

@@ -0,0 +1,4 @@
+/**
+ * Avl 二叉平衡树
+ */
+

house_rob.py

@@ -0,0 +1,19 @@
+# Leet Code
+# 一个贼，去别人家偷东西，不能偷连续的两家，否则会报警，
+# 每家能偷的金额已经知道了，选择偷哪几家能够最大化收益？
+
+def rob(nums):
+    now = 0
+    last = 0
+
+    for n in nums:
+        temp = now
+        now = max(now, last + n)
+        last = temp
+
+    return now
+
+
+if __name__ == '__main__':
+    houses = [1, 34, 56, 1, 26, 99, 100, 200, 1, 2, 98]
+    print(rob(houses))

red_black_tree.js

@@ -0,0 +1,3 @@
+/**
+ * 红黑树
+ */

reverseString.js

@@ -0,0 +1,26 @@
+/*
+ * Reverse an array which contains much more chars.
+ */
+
+const a = [":","W","\"","7"," ",".","s"," ","6","S","v","X",";","P","!","i"," ","1","`","0",".","\"","8","f",".","Y","W","7"," ","5","u","f","m","Q","V","E","X","!","E","D","e","Z","`","p","0","!","l","8","9","'","!","'","x","V","o","?","N","P","S","j","'","Q","?","s","?","'","2","T","0","R","N","p","n","v","7","u","u","?","v","?","!",";","a","!"," ","v"," ","\"","S","3","7","2","Y","`","B","j","5","l","3","2","H",";","f","u",":","`","8","X","!","Q","B","M","0","'","`","7","'","\""," ","\"",",","5",".","0","Q"," "," "," "," ","Q","0",".","5",",","\""," ","\"","3","7","`","3","0","M","B","Q","!","X","8","`",":","u","f",";","H","2","3","l","5","j","B","`","Y","2","7","3","S","\""," ","v"," ","!","a",";","!","?","v","?","u","u","7","v","n","p","N","R","0","T","2","'","?","s","?","Q","'","j","S","P","N","?","o","V","x","'","!","'","9","8","l","!","0","p","`","Z","e","D","E","!","X","E","V","Q","m","f","u","5"," ","7","W","Y",".","f","8","\"",".","0","`","1"," ","i","!","P",";","X","v","S","6"," ","s","."," ","7","\"","W",":"]
+
+const reverseString = function(s) {
+  const size = s.length
+  const lastIndex = size - 1;
+
+  const halfSize = size / 2;
+  const absHalfSize = parseInt(halfSize)
+
+  const middleIndex = halfSize === absHalfSize ? absHalfSize - 1 : absHalfSize
+
+  
+  for (let i=0; i <= middleIndex; i++) {
+    var j = s[i]
+
+    s[i] = s[lastIndex - i]
+    s[lastIndex - i] = j
+
+  }
+};
+
+reverseString(a)

reverseStringArray.js

@@ -0,0 +1,26 @@
+/*
+ * Reverse an array which contains much more chars.
+ */
+
+const a = [":","W","\"","7"," ",".","s"," ","6","S","v","X",";","P","!","i"," ","1","`","0",".","\"","8","f",".","Y","W","7"," ","5","u","f","m","Q","V","E","X","!","E","D","e","Z","`","p","0","!","l","8","9","'","!","'","x","V","o","?","N","P","S","j","'","Q","?","s","?","'","2","T","0","R","N","p","n","v","7","u","u","?","v","?","!",";","a","!"," ","v"," ","\"","S","3","7","2","Y","`","B","j","5","l","3","2","H",";","f","u",":","`","8","X","!","Q","B","M","0","'","`","7","'","\""," ","\"",",","5",".","0","Q"," "," "," "," ","Q","0",".","5",",","\""," ","\"","3","7","`","3","0","M","B","Q","!","X","8","`",":","u","f",";","H","2","3","l","5","j","B","`","Y","2","7","3","S","\""," ","v"," ","!","a",";","!","?","v","?","u","u","7","v","n","p","N","R","0","T","2","'","?","s","?","Q","'","j","S","P","N","?","o","V","x","'","!","'","9","8","l","!","0","p","`","Z","e","D","E","!","X","E","V","Q","m","f","u","5"," ","7","W","Y",".","f","8","\"",".","0","`","1"," ","i","!","P",";","X","v","S","6"," ","s","."," ","7","\"","W",":"]
+
+const reverseString = function(s) {
+  const size = s.length
+  const lastIndex = size - 1;
+
+  const halfSize = size / 2;
+  const absHalfSize = parseInt(halfSize)
+
+  const middleIndex = halfSize === absHalfSize ? absHalfSize - 1 : absHalfSize
+
+  
+  for (let i=0; i <= middleIndex; i++) {
+    var j = s[i]
+
+    s[i] = s[lastIndex - i]
+    s[lastIndex - i] = j
+
+  }
+};
+
+reverseString(a)

string-reverse.js

@@ -0,0 +1,22 @@
+/**
+ * 反转字符串
+ *
+ * 'chenyuan' ---> 'nauynehc'
+ */
+
+const reverseString = str => {
+  const strLength = str.length
+  let result = ''
+
+  for (let i = strLength - 1; i > -1; i--) {
+    result += str[i]
+  }
+
+  return result
+}
+
+a = 'chenyuan, hello0, world'
+
+console.log(a)
+
+console.log(reverseString(a))