Add Solution.java to problems 0034

Author: huaxu1024

Diff for: solution/0034.Find First and Last Position of Element in Sorted Array/Solution.java

@@ -11,6 +11,7 @@ public int[] searchRange(int[] nums, int target) {
         }
         return new int[]{-1,-1};
     }
+
     private int findFirst(int[] nums, int start, int end, int target) {
         while (start < end) {
             int temp = start + (end - start) / 2;
@@ -19,6 +20,7 @@ private int findFirst(int[] nums, int start, int end, int target) {
         }
         return start;
     }
+
     private int findEnd(int[] nums, int start, int end, int target) {
         while (start < end) {
             int temp = start + (end - start + 1) / 2;

Diff for: solution/0034.Find First and Last Position of Element in Sorted Array/Solution2.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int[] searchRange(int[] nums, int target) {
+        int left = 0, right = nums.length - 1;
+        while (left <= right) {
+            int mid = left + (right - left) / 2;
+            if (nums[mid] == target) {
+                int resL = mid, resR = mid;
+                while (resL > left && nums[resL - 1] == target) resL--;
+                while (resR < right && nums[resR + 1] == target) resR++;
+                return new int[]{resL, resR};
+            }
+            if (nums[mid] > target) {
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return new int[]{-1, -1};
+    }
+}