add search in rotated sorted array solution

Author: Tessa1217

search-in-rotated-sorted-array/Tessa1217.java

@@ -0,0 +1,35 @@
+class Solution {
+
+    // 이진 탐색: 시간복잡도: O(log n)
+    public int search(int[] nums, int target) {
+
+        int left = 0;
+        int right = nums.length - 1;
+
+        while (left <= right) {
+
+            int mid = left + (right - left)/2;
+
+            if (nums[mid] == target) {
+                return mid;
+            }
+
+            // 구간 설정
+            if (nums[left] <= nums[mid]) {
+                if (nums[left] <= target && target < nums[mid]) {
+                    right = mid - 1;
+                } else {
+                    left = mid + 1;
+                }
+            } else {
+                if (nums[mid] < target && target <= nums[right]) {
+                    left = mid + 1;
+                } else {
+                    right = mid - 1;
+                }
+            }
+        }
+
+        return -1;
+    }
+}