Merge branch 'youngyangyang04:master' into master

problems/0435.无重叠区间.md

@@ -228,7 +228,27 @@ class Solution:
 
 Go：
 
+Javascript:
+```Javascript
+var eraseOverlapIntervals = function(intervals) {
+    intervals.sort((a, b) => {
+        return a[1] - b[1]
+    })
 
+    let count = 1
+    let end = intervals[0][1]
+
+    for(let i = 1; i < intervals.length; i++) {
+        let interval = intervals[i]
+        if(interval[0] >= right) {
+            end = interval[1]
+            count += 1
+        }
+    }
+    
+    return intervals.length - count
+};
+```
 
 
 -----------------------

problems/0763.划分字母区间.md

@@ -128,7 +128,26 @@ class Solution:
 
 Go：
 
-
+Javascript:
+```Javascript
+var partitionLabels = function(s) {
+    let hash = {}
+    for(let i = 0; i < s.length; i++) {
+        hash[s[i]] = i
+    }
+    let result = []
+    let left = 0
+    let right = 0
+    for(let i = 0; i < s.length; i++) {
+        right = Math.max(right, hash[s[i]])
+        if(right === i) {
+            result.push(right - left + 1)
+            left = i + 1
+        }
+    }
+    return result
+};
+```
 
 
 -----------------------

problems/二叉树的递归遍历.md

@@ -221,7 +221,7 @@ class Solution:
 Go：
 
 前序遍历:
-```
+```go
 func PreorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {
@@ -239,7 +239,7 @@ func PreorderTraversal(root *TreeNode) (res []int) {
 ```
 中序遍历:
 
-```
+```go
 func InorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {
@@ -256,7 +256,7 @@ func InorderTraversal(root *TreeNode) (res []int) {
 ```
 后序遍历:
 
-```
+```go
 func PostorderTraversal(root *TreeNode) (res []int) {
     var traversal func(node *TreeNode)
     traversal = func(node *TreeNode) {