这个rotated sorted array问题# JobHunting - 待字闺中
I*A
1 楼
Given a sorted list of N integers that has been rotated an unknown number of
positions, e.g., 15 36 1 7 12 13 14。 design an lg(n) algorithm to
determine if a given integer is in the list
你们谁写过code,可否share share? 我比较着比较着就乱了。。
positions, e.g., 15 36 1 7 12 13 14。 design an lg(n) algorithm to
determine if a given integer is in the list
你们谁写过code,可否share share? 我比较着比较着就乱了。。