Given a sorted (ascending) array of distinct integers nums and an integer target , return the index of target if it is present, otherwise -1 . Your algorithm must run in O(log n) time. Input format Input is [nums, target] , e.g. [[-1,0,3,5,9,12],9] .