@@ -0,0 +1,649 @@
+class Solution:%0A    # @param %7Binteger%5B%5D%7D nums%0A    # @param %7Binteger%7D target%0A    # @return %7Binteger%7D%0A    def search(self, nums, target):%0A        l, r = 0, len(nums) - 1%0A        %0A        while l %3C= r:%0A            m = (l + r) / 2%0A            if nums%5Bm%5D == target:%0A                return m%0A            elif nums%5Bm%5D %3C nums%5Br%5D:%0A                if nums%5Bm%5D %3C target and target %3C= nums%5Br%5D:%0A                    l = m + 1%0A                else:%0A                    r = m - 1%0A            else:%0A                if nums%5Bl%5D %3C= target and target %3C nums%5Bm%5D:%0A                    r = m - 1%0A                else:%0A                    l = m + 1%0A        %0A        return -1%0A

Create SearchinRSArr_002.py