Merge pull request #12 from fartem/35_Search_Insert_Position

2023-02-06 update: added "35. Search Insert Position"

Author: fartem

README.md

@@ -21,3 +21,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 20. Valid Parentheses      | [Link](https://leetcode.com/problems/valid-parentheses/)      | [Link](./lib/easy/valid_parentheses.dart)      |
 | 21. Merge Two Sorted Lists | [Link](https://leetcode.com/problems/merge-two-sorted-lists/) | [Link](./lib/easy/merge_two_sorted_lists.dart) |
 | 27. Remove Element         | [Link](https://leetcode.com/problems/remove-element/)         | [Link](./lib/easy/remove_element.dart)         |
+| 35. Search Insert Position | [Link](https://leetcode.com/problems/search-insert-position/) | [Link](./lib/easy/search_insert_position.dart) |

lib/easy/search_insert_position.dart

@@ -0,0 +1,19 @@
+// https://leetcode.com/problems/search-insert-position/description/
+class Solution {
+  int searchInsert(List<int> nums, int target) {
+    if (nums[nums.length - 1] < target) {
+      return nums.length;
+    }
+    var l = 0;
+    var r = nums.length - 1;
+    while (l < r) {
+      var m = l + (r - l) ~/ 2;
+      if (nums[m] < target) {
+        l = m + 1;
+      } else {
+        r = m;
+      }
+    }
+    return l;
+  }
+}

test/easy/search_insert_position_test.dart

@@ -0,0 +1,14 @@
+import 'package:leetcode_dart/easy/search_insert_position.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group(
+    'Example tests',
+    () {
+      final sip = Solution();
+      test('2', () => expect(2, sip.searchInsert([1, 3, 5, 6], 5)));
+      test('1', () => expect(1, sip.searchInsert([1, 3, 5, 6], 2)));
+      test('4', () => expect(4, sip.searchInsert([1, 3, 5, 6], 7)));
+    },
+  );
+}