2016年7月24日
35. Search Insert Position
摘要： 35. Search Insert Position 35. Search Insert Position Given a sorted array and a target value, return the index if the target is found. If not, return 阅读全文
posted @ 2016-07-24 13:27 新一代的天皇巨星 阅读(204) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II && 153. Find Minimum in Rotated Sorted Array && 154. Find Minimum in Rotated Sorted Array II
摘要： 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 7 might become 4 5 6 阅读全文
posted @ 2016-07-24 07:58 新一代的天皇巨星 阅读(154) 评论(0) 推荐(0)
12. Integer to Roman && 13. Roman to Integer && 273. Integer to English Words
摘要： 12. Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. Hide Tags Math String 阅读全文
posted @ 2016-07-24 05:10 新一代的天皇巨星 阅读(133) 评论(0) 推荐(0)
343. Integer Break
摘要： 343. Integer Break Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Ret 阅读全文
posted @ 2016-07-24 05:05 新一代的天皇巨星 阅读(192) 评论(0) 推荐(0)