2015 年 6月 15 日随笔档案 - NealCaffrey989

2015年6月15日

摘要： 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 @ 2015-06-15 21:37 NealCaffrey989 阅读(119) 评论(0) 推荐(0)

[LeetCode] #34 Search for a Range

摘要： 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 ord... 阅读全文

posted @ 2015-06-15 21:33 NealCaffrey989 阅读(188) 评论(0) 推荐(0)

[LeetCode] #33 Search in Rotated Sorted Array

摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文

posted @ 2015-06-15 12:09 NealCaffrey989 阅读(159) 评论(0) 推荐(0)

[LeetCode] #32 Longest Valid Parentheses

摘要： Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文

posted @ 2015-06-15 11:27 NealCaffrey989 阅读(148) 评论(0) 推荐(0)

[LeetCode] #31 Next Permutation

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文

posted @ 2015-06-15 11:11 NealCaffrey989 阅读(123) 评论(0) 推荐(0)