diff --git a/problems/0042.接雨水.md b/problems/0042.接雨水.md
index 235776a0..a2cb2345 100644
--- a/problems/0042.接雨水.md
+++ b/problems/0042.接雨水.md
@@ -388,6 +388,44 @@ class Solution:
                 res += res1
         return res
 ```
+动态规划
+```python3
+class Solution:
+    def trap(self, height: List[int]) -> int:
+        leftheight, rightheight = [0]*len(height), [0]*len(height)
+        
+        leftheight[0]=height[0]
+        for i in range(1,len(height)):
+            leftheight[i]=max(leftheight[i-1],height[i])
+        rightheight[-1]=height[-1]
+        for i in range(len(height)-2,-1,-1):
+            rightheight[i]=max(rightheight[i+1],height[i])
+        
+        result = 0
+        for i in range(0,len(height)):
+            summ = min(leftheight[i],rightheight[i])-height[i]
+            result += summ
+        return result
+```
+单调栈
+```python3
+class Solution:
+    def trap(self, height: List[int]) -> int:
+        st =[0]
+        result = 0
+        for i in range(1,len(height)):
+            while st!=[] and height[i]>height[st[-1]]:
+                midh = height[st[-1]]
+                st.pop()
+                if st!=[]:
+                    hright = height[i]
+                    hleft = height[st[-1]]
+                    h = min(hright,hleft)-midh
+                    w = i-st[-1]-1
+                    result+=h*w
+            st.append(i)
+        return result
+```
 
 Go:
 
diff --git a/problems/0084.柱状图中最大的矩形.md b/problems/0084.柱状图中最大的矩形.md
index f0f58c0f..941888db 100644
--- a/problems/0084.柱状图中最大的矩形.md
+++ b/problems/0084.柱状图中最大的矩形.md
@@ -191,4 +191,57 @@ public:
 
 这里我依然建议大家按部就班把版本一写出来，把情况一二三分析清楚，然后在精简代码到版本二。 直接看版本二容易忽略细节！
 
+## 其他语言版本 
+
+Java: 
+
+Python:
+
+动态规划
+```python3
+class Solution:
+    def largestRectangleArea(self, heights: List[int]) -> int:
+        result = 0
+        minleftindex, minrightindex = [0]*len(heights), [0]*len(heights)
+        
+        minleftindex[0]=-1
+        for i in range(1,len(heights)):
+            t = i-1
+            while t>=0 and heights[t]>=heights[i]: t=minleftindex[t]
+            minleftindex[i]=t
+            
+        minrightindex[-1]=len(heights)
+        for i in range(len(heights)-2,-1,-1):
+            t=i+1
+            while t<len(heights) and heights[t]>=heights[i]: t=minrightindex[t]
+            minrightindex[i]=t
+        
+        for i in range(0,len(heights)):
+            left = minleftindex[i]
+            right = minrightindex[i]
+            summ = (right-left-1)*heights[i]
+            result = max(result,summ)
+        return result
+```
+单调栈 版本二
+```python3
+class Solution:
+    def largestRectangleArea(self, heights: List[int]) -> int:
+        heights.insert(0,0) # 数组头部加入元素0
+        heights.append(0) # 数组尾部加入元素0
+        st = [0]
+        result = 0
+        for i in range(1,len(heights)):
+            while st!=[] and heights[i]<heights[st[-1]]:
+                midh = heights[st[-1]]
+                st.pop()
+                if st!=[]:
+                    minrightindex = i
+                    minleftindex = st[-1]
+                    summ = (minrightindex-minleftindex-1)*midh
+                    result = max(summ,result)
+            st.append(i)
+        return result
+```
+
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码.jpg width=450> </img></div>
diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 007eac44..0f9b2df6 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1205,6 +1205,35 @@ public:
 };
 ```
 
+java代码：
+
+```java
+class Solution {
+    public Node connect(Node root) {
+	Queue<Node> tmpQueue = new LinkedList<Node>();
+	if (root != null) tmpQueue.add(root);
+		
+	while (tmpQueue.size() != 0){
+	    int size = tmpQueue.size();
+            
+            Node cur = tmpQueue.poll();
+            if (cur.left != null) tmpQueue.add(cur.left);
+            if (cur.right != null) tmpQueue.add(cur.right);
+            
+	    for (int index = 1; index < size; index++){
+		Node next = tmpQueue.poll();
+		if (next.left != null) tmpQueue.add(next.left);
+		if (next.right != null) tmpQueue.add(next.right);
+                
+                cur.next = next;
+                cur = next;
+	    }
+	}
+        
+        return root;
+    }
+}
+```
 
 python代码：
 
diff --git a/problems/剑指Offer58-II.左旋转字符串.md b/problems/剑指Offer58-II.左旋转字符串.md
index 76908f2d..1073dafa 100644
--- a/problems/剑指Offer58-II.左旋转字符串.md
+++ b/problems/剑指Offer58-II.左旋转字符串.md
@@ -141,6 +141,18 @@ class Solution:
 # 空间复杂度：O(n)，python的string为不可变，需要开辟同样大小的list空间来修改
 ```
 
+```python 3
+#方法三：考虑不能用切片的情况下，利用模+下标实现
+class Solution:
+    def reverseLeftWords(self, s: str, n: int) -> str:
+        new_s = ''
+        for i in range(len(s)):
+            j = (i+n)%len(s)
+            new_s = new_s + s[j]
+        return new_s
+
+```
+
 Go：
 
 ```go