摘要：
标题：Unique Binary Search Trees通过率：37.0%难度：中等Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= ... 阅读全文
摘要：
标题：Sort List通过率：21.3%难度：中等Sort a linked list inO(nlogn) time using constant space complexity.本题就是一个排序的问题，但是是针对单向链表去处理，那么问题关键就是怎么去处理链表，时间复杂度为nlogn，所以可以... 阅读全文
摘要：
标题：Find Minimum in Rotated Sorted Array II通过率：31.1%难度：难Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this aff... 阅读全文
摘要：
标题：Find Minimum in Rotated Sorted Array通过率：32.8%难度：中等Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7migh... 阅读全文
摘要：
标题：Maximum Subarray通过率：34.5%难度：中等Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, ... 阅读全文
摘要：
题目：Search Insert Position通过率：35.3%难度：中等Given a sorted array and a target value, return the index if the target is found. If not, return the index wher... 阅读全文
摘要：
题目Search in Rotated Sorted ArrayII通过率：31.4%难度：中等Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-... 阅读全文
摘要：
标题：Search in Rotated Sorted Array通过率：28.9%难度：难Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might becom... 阅读全文
摘要：
标题：Multiply Strings通过率： 20.8%难度：中等Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be ... 阅读全文
摘要：
标题：Integer to Roman通过率：34.4%难度：中等Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.前面做过数字转罗马数字... 阅读全文