Search in Rotated Sorted Array

There is an integer array `nums` sorted in ascending order (with distinct values) that has been rotated at some pivot. Given the array and a target value, return the index of target if found, or -1 otherwise. You must write an algorithm with O(log n) runtime complexity.