diff --git "a/problems/0151.\347\277\273\350\275\254\345\255\227\347\254\246\344\270\262\351\207\214\347\232\204\345\215\225\350\257\215.md" "b/problems/0151.\347\277\273\350\275\254\345\255\227\347\254\246\344\270\262\351\207\214\347\232\204\345\215\225\350\257\215.md"
index 19ccb725a0..cff207a926 100644
--- "a/problems/0151.\347\277\273\350\275\254\345\255\227\347\254\246\344\270\262\351\207\214\347\232\204\345\215\225\350\257\215.md"
+++ "b/problems/0151.\347\277\273\350\275\254\345\255\227\347\254\246\344\270\262\351\207\214\347\232\204\345\215\225\350\257\215.md"
@@ -547,26 +547,28 @@ func reverseWords(s string) string {
 		b = b[:slowIndex]
 	}
 	//2.反转整个字符串
-	reverse(&b, 0, len(b)-1)
+	reverse(b)
 	//3.反转单个单词  i单词开始位置，j单词结束位置
 	i := 0
 	for i < len(b) {
 		j := i
 		for ; j < len(b) && b[j] != ' '; j++ {
 		}
-		reverse(&b, i, j-1)
+		reverse(b[i:j])
 		i = j
 		i++
 	}
 	return string(b)
 }
 
-func reverse(b *[]byte, left, right int) {
-	for left < right {
-		(*b)[left], (*b)[right] = (*b)[right], (*b)[left]
-		left++
-		right--
-	}
+func reverse(b []byte) {
+    left := 0
+    right := len(b) - 1
+    for left < right {
+        b[left], b[right] = b[right], b[left]
+        left++
+        right--
+    }
 }
 ```
 
diff --git "a/problems/0704.\344\272\214\345\210\206\346\237\245\346\211\276.md" "b/problems/0704.\344\272\214\345\210\206\346\237\245\346\211\276.md"
index 52abf57851..1916d47a7f 100644
--- "a/problems/0704.\344\272\214\345\210\206\346\237\245\346\211\276.md"
+++ "b/problems/0704.\344\272\214\345\210\206\346\237\245\346\211\276.md"
@@ -760,8 +760,56 @@ object Solution {
   }
 }
 ```
+**Dart:**
 
 
+
+```dart
+（版本一）左闭右闭区间
+class Solution {
+  int search(List<int> nums, int target) {
+    int left = 0;
+    int right = nums.length - 1;
+    while (left <= right) {
+      int middle = ((left + right)/2).truncate();
+      switch (nums[middle].compareTo(target)) {
+        case 1:
+          right = middle - 1;
+          continue;
+        case -1:
+          left = middle + 1;
+          continue;
+        default:
+          return middle;
+      }
+    }
+    return -1;
+  }
+}
+
+（版本二）左闭右开区间
+class Solution {
+  int search(List<int> nums, int target) {
+    int left = 0;
+    int right = nums.length;
+    while (left < right) {
+      int middle = left + ((right - left) >> 1);
+      switch (nums[middle].compareTo(target)) {
+        case 1:
+          right = middle;
+          continue;
+        case -1:
+          left = middle + 1;
+          continue;
+        default:
+          return middle;
+      }
+    }
+    return -1;
+  }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>