摘要：
leetcode 35. Search Insert Position Easy descrition Given a sorted array and a target value, return the index if the target is found. If not, return t 阅读全文
摘要：
leetcode 34. Search for a Range Medium descrition Given an array of integers sorted in ascending order, find the starting and ending position of a giv 阅读全文
摘要：
leetcode 33. Search in Rotated Sorted Array Medium descrition Suppose an array sorted in ascending order is rotated at some pivot unknown to you befor 阅读全文
摘要：
leetcode 31. Next Permutation Medium descrition Implement next permutation, which rearranges numbers into the lexicographically next greater permutati 阅读全文