An ascending sorted array is rotated at some pivot. Given the rotated array nums and a target, return its index or -1 if not found. Algorithm must be O(log n).