Update

Author: youngyangyang04

problems/0020.有效的括号.md

@@ -159,7 +159,7 @@ class Solution {
 ```
 
 Python：
-```python3
+```python
 # 方法一，仅使用栈，更省空间
 class Solution:
     def isValid(self, s: str) -> bool:
@@ -180,7 +180,7 @@ class Solution:
         return True if not stack else False
 ```
 
-```python3
+```python
 # 方法二，使用字典
 class Solution:
     def isValid(self, s: str) -> bool:

problems/0027.移除元素.md

@@ -142,7 +142,7 @@ class Solution {
 
 Python：
 
-```python3
+```python
 class Solution:
     """双指针法
     时间复杂度：O(n)

problems/0035.搜索插入位置.md

@@ -246,7 +246,7 @@ func searchInsert(nums []int, target int) int {
 ```
 
 ### Python 
-```python3
+```python
 class Solution:
     def searchInsert(self, nums: List[int], target: int) -> int:
         left, right = 0, len(nums) - 1

problems/0039.组合总和.md

@@ -264,7 +264,7 @@ class Solution {
 
 ## Python  
 **回溯**
-```python3
+```python
 class Solution:
     def __init__(self):
         self.path = []
@@ -296,7 +296,7 @@ class Solution:
             self.path.pop()        # 回溯
 ```
 **剪枝回溯**
-```python3
+```python
 class Solution:
     def __init__(self):
         self.path = []

problems/0040.组合总和II.md

@@ -334,7 +334,7 @@ class Solution {
 
 ## Python 
 **回溯+巧妙去重(省去使用used**
-```python3
+```python
 class Solution:
     def __init__(self):
         self.paths = []
@@ -374,7 +374,7 @@ class Solution:
             sum_ -= candidates[i]       # 回溯，为了下一轮for loop
 ```
 **回溯+去重（使用used）**
-```python3
+```python
 class Solution:
     def __init__(self):
         self.paths = []

problems/0042.接雨水.md

@@ -491,7 +491,7 @@ class Solution:
         return res
 ```
 动态规划
-```python3
+```python
 class Solution:
     def trap(self, height: List[int]) -> int:
         leftheight, rightheight = [0]*len(height), [0]*len(height)

problems/0046.全排列.md

@@ -243,7 +243,7 @@ class Solution:
             usage_list[i] = False
 ```
 **回溯+丢掉usage_list**
-```python3
+```python
 class Solution:
     def __init__(self):
         self.path = []

problems/0059.螺旋矩阵II.md

@@ -188,9 +188,9 @@ class Solution {
 }
 ```
 
-python:
+python3:
 
-```python3
+```python
 class Solution:
 
     def generateMatrix(self, n: int) -> List[List[int]]:

problems/0070.爬楼梯完全背包版本.md

@@ -143,10 +143,10 @@ class Solution {
 }
 ```
 
-Python：
+Python3：
 
 
-```python3
+```python
 class Solution:
     def climbStairs(self, n: int) -> int:
         dp = [0]*(n + 1)

problems/0077.组合优化.md

@@ -174,7 +174,7 @@ class Solution {
 ```
 
 Python：
-```python3
+```python
 class Solution:
     def combine(self, n: int, k: int) -> List[List[int]]:
         res=[]  #存放符合条件结果的集合