submit code

Author: 谭佳胜

Diameter of Binary Tree/index.js

@@ -0,0 +1,15 @@
+const depth = function(node, result) {
+    if (!node) return 0;
+    
+    const leftDepth = depth(node.left, result);
+    const rightDepth = depth(node.right, result);
+    
+    result.val = Math.max(leftDepth + rightDepth + 1, result.val);
+    
+    return Math.max(leftDepth, rightDepth) + 1;
+}
+const diameterOfBinaryTree = function(root) {
+    const result = { val: 1 };
+    depth(root, result);
+    return result.val - 1;
+};

Diameter of Binary Tree/readme.md

@@ -0,0 +1 @@
+最长长度为左边子树深度+右边子树深度最大的值

Rotate Image/index.js

@@ -0,0 +1,14 @@
+const rotate = function(matrix) {
+    const n = matrix.length;
+    const layer = parseInt(n / 2);
+    
+    for (let i = 0; i < layer; i++) {
+        for (let j = 0; j < n - 2 * i - 1; j++) {
+            let temp = matrix[i + j][i];
+            matrix[i + j][i] = matrix[n - i - 1][i + j];
+            matrix[n - i - 1][i + j] = matrix[n - i - j - 1][n - i - 1];
+            matrix[n - i - j - 1][n - i - 1] =  matrix[i][n - i - j - 1];
+            matrix[i][n - i - j - 1] = temp;
+        }
+    }
+};

Rotate Image/readme.md

@@ -0,0 +1 @@
+二维数组按照层次顺序，4个一组来替换位置

ZigZag Conversion/index.js

@@ -0,0 +1,8 @@
+/**
+ * @param {string} s
+ * @param {number} numRows
+ * @return {string}
+ */
+var convert = function(s, numRows) {
+    const arr = []
+};