solve problem Find First And Last Position Of Element In Sorted Array

Author: P-ppc

README.md

@@ -292,6 +292,7 @@ All solutions will be accepted!
 |48|[Rotate Image](https://leetcode-cn.com/problems/rotate-image/description/)|[java/py/js](./algorithms/RotateImage)|Medium|
 |74|[Search A 2d Matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/description/)|[java/py/js](./algorithms/SearchA2dMatrix)|Medium|
 |153|[Find Minimum In Rotated Sorted Array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/description/)|[java/py/js](./algorithms/FindMinimumInRotatedSortedArray)|Medium|
+|34|[Find First And Last Position Of Element In Sorted Array](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/)|[java/py/js](./algorithms/FindFirstAndLastPositionOfElementInSortedArray)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/FindFirstAndLastPositionOfElementInSortedArray/README.md

@@ -0,0 +1,2 @@
+# Find First And Last Position Of Element In Sorted Array
+We can solve this problem by binary search

algorithms/FindFirstAndLastPositionOfElementInSortedArray/Solution.java

@@ -0,0 +1,41 @@
+class Solution {
+    public int[] searchRange(int[] nums, int target) {
+        int length = nums.length;
+        if (length == 0)
+            return new int[]{-1, -1};
+
+        int low = 0,
+            high = length - 1;
+
+        while (low < high) {
+            int mid = (low + high) / 2;
+
+            if (nums[mid] < target)
+                low = mid + 1;
+            else if (nums[mid] > target)
+                high = mid - 1;
+            else
+                high = mid;
+        }
+
+        if (nums[low] != target)
+            return new int[]{-1, -1};
+
+        int temp = low;
+        low = 0;
+        high = length - 1;
+
+        while (low < high) {
+            int mid = (int) Math.ceil((low + high) / 2.0);
+
+            if (nums[mid] < target)
+                low = mid + 1;
+            else if (nums[mid] > target)
+                high = mid - 1;
+            else
+                low = mid;
+        }
+
+        return new int[]{temp, low};
+    }
+}

algorithms/FindFirstAndLastPositionOfElementInSortedArray/solution.js

@@ -0,0 +1,44 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var searchRange = function(nums, target) {
+    let length = nums.length
+    if (length == 0)
+        return [-1, -1]
+    
+    let low = 0,
+        high = length - 1
+    
+    while (low < high) {
+        let mid = parseInt((low + high) / 2)
+        
+        if (nums[mid] < target)
+            low = mid + 1
+        else if (nums[mid] > target)
+            high = mid - 1
+        else
+            high = mid
+    }
+    
+    if (nums[low] != target)
+        return [-1, -1]
+    
+    let temp = low
+    low = 0
+    high = length - 1
+    
+    while (low < high) {
+        let mid = Math.ceil((low + high) / 2)
+        
+        if (nums[mid] < target)
+            low = mid + 1
+        else if (nums[mid] > target)
+            high = mid - 1
+        else
+            low = mid
+    }
+    
+    return [temp, low]
+};

algorithms/FindFirstAndLastPositionOfElementInSortedArray/solution.py

@@ -0,0 +1,41 @@
+class Solution(object):
+    def searchRange(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        low = 0
+        high = len(nums) - 1
+        
+        if high < 0:
+            return -1, -1
+        
+        while low < high:
+            mid = (low + high) / 2
+            
+            if nums[mid] < target:
+                low = mid + 1
+            elif nums[mid] > target:
+                high = mid - 1
+            else:
+                high = mid
+        
+        if nums[low] != target:
+            return -1, -1
+        
+        i = low        
+        low = 0
+        high = len(nums) - 1
+        
+        while low < high:
+            mid = int(math.ceil((low + high) / 2.0))
+            
+            if nums[mid] < target:
+                low = mid + 1
+            elif nums[mid] > target:
+                high = mid - 1
+            else:
+                low = mid
+                
+        return i, low