摘要：
problem description: given a sorted aescend array,return the begining and ending position of the target num i.e: [1,2,3,8,8,9] return [3,4] of course, 阅读全文
摘要：
descripte problem: there is an array,at the first it is sorted,but for som reason, it was rotated at some pivot unknown to you beforehand.then you sho 阅读全文