2017年4月11日
34. Search for a Range(C++)
摘要： Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
posted @ 2017-04-11 21:25 DevinGu 阅读(175) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array(C++)
摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
posted @ 2017-04-11 20:40 DevinGu 阅读(188) 评论(0) 推荐(0)
22. Generate Parentheses(C++)
摘要： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: 阅读全文
posted @ 2017-04-11 20:11 DevinGu 阅读(269) 评论(0) 推荐(0)