add code

Author: ncdhz

code/572.另一棵树的子树.js

@@ -0,0 +1,54 @@
+/*
+ * @lc app=leetcode.cn id=572 lang=javascript
+ *
+ * [572] 另一棵树的子树
+ */
+
+// @lc code=start
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ * this.val = (val===undefined ? 0 : val)
+ * this.left = (left===undefined ? null : left)
+ * this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} subRoot
+ * @return {boolean}
+ */
+
+var same = function(root, sub) {
+ 
+ if (root === null) {
+ if (sub === null)
+ return true
+ return false
+ }
+
+ if (sub === null) {
+ return false
+ }
+ 
+ if (root.val !== sub.val) {
+ return false
+ }
+ 
+ return same(root.left, sub.left) && same(root.right, sub.right)
+}
+
+var isSubtree = function(root, subRoot) {
+ if (same(root, subRoot)) {
+ return true
+ }
+ if (root.left !== null && isSubtree(root.left, subRoot)) {
+ return true
+ }
+ if (root.right !== null && isSubtree(root.right, subRoot)) {
+ return true
+ } 
+ return false
+};
+// @lc code=end
+

code/575.分糖果.js

@@ -0,0 +1,21 @@
+/*
+ * @lc app=leetcode.cn id=575 lang=javascript
+ *
+ * [575] 分糖果
+ */
+
+// @lc code=start
+/**
+ * @param {number[]} candyType
+ * @return {number}
+ */
+var distributeCandies = function(candyType) {
+ let s = new Set()
+ for (let i = 0; i < candyType.length; i++) {
+ s.add(candyType[i])
+ }
+ let j = parseInt(candyType.length / 2)
+ return s.size > j ? j : s.size
+};
+// @lc code=end
+

code/589.n-叉树的前序遍历.js

@@ -0,0 +1,40 @@
+/*
+ * @lc app=leetcode.cn id=589 lang=javascript
+ *
+ * [589] N 叉树的前序遍历
+ */
+
+// @lc code=start
+/**
+ * // Definition for a Node.
+ * function Node(val, children) {
+ * this.val = val;
+ * this.children = children;
+ * };
+ */
+
+/**
+ * @param {Node|null} root
+ * @return {number[]}
+ */
+var preorder = function(root) {
+ if (root === null) {
+ return []
+ }
+ let a = []
+ a.push(root)
+ let rs = []
+ while (a.length > 0) {
+ let r = a.pop()
+ 
+ rs.push(r.val)
+
+ for (let i = r.children.length - 1; i > -1;i--) {
+ a.push(r.children[i])
+ }
+
+ }
+ return rs
+};
+// @lc code=end
+

code/590.n-叉树的后序遍历.js

@@ -0,0 +1,35 @@
+/*
+ * @lc app=leetcode.cn id=590 lang=javascript
+ *
+ * [590] N 叉树的后序遍历
+ */
+
+// @lc code=start
+/**
+ * // Definition for a Node.
+ * function Node(val,children) {
+ * this.val = val;
+ * this.children = children;
+ * };
+ */
+
+/**
+ * @param {Node|null} root
+ * @return {number[]}
+ */
+var postorder = function(root) {
+ if (root === null) return []
+ let rs = []
+ let a = []
+ a.push(root)
+ while (a.length > 0) {
+ let n = a.pop()
+ rs.unshift(n.val)
+ for (let r of n.children) {
+ a.push(r)
+ }
+ }
+ return rs
+};
+// @lc code=end
+

code/915.分割数组.js

@@ -0,0 +1,28 @@
+/*
+ * @lc app=leetcode.cn id=915 lang=javascript
+ *
+ * [915] 分割数组
+ */
+
+// @lc code=start
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var partitionDisjoint = function(nums) {
+ r = 0
+ cur_max = nums[0]
+ left_max = nums[0]
+ 
+ for (let i = 1; i < nums.length; i++) {
+ cur_max = Math.max(nums[i], cur_max)
+ if (left_max > nums[i]) {
+ r = i
+ left_max = cur_max
+ }
+ }
+
+ return r + 1 
+};
+// @lc code=end
+