摘要：
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2016-05-23 23:36
Black_Knight
阅读(223)
评论(0)
推荐(0)
摘要：
Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the or 阅读全文
posted @ 2016-05-23 23:03
Black_Knight
阅读(207)
评论(0)
推荐(0)
摘要：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2016-05-23 17:57
Black_Knight
阅读(157)
评论(0)
推荐(0)
浙公网安备 33010602011771号