上一页 1 2 3 4 5 6 7 8 ··· 31 下一页
摘要: 题目: 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 7 0 1 2). Find the minimum elem 阅读全文
posted @ 2017-06-14 05:40 panini 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 题目: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2, 阅读全文
posted @ 2017-06-14 01:53 panini 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 题目: Given an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky the". Update (2015-02-12):For 阅读全文
posted @ 2017-06-13 20:06 panini 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 题目: Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or anoth 阅读全文
posted @ 2017-06-13 10:35 panini 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 题目: Sort a linked list in O(n log n) time using constant space complexity. 链接: http://leetcode.com/problems/sort-list/ 6/12/2017 10ms, 24%,merge sort, 阅读全文
posted @ 2017-06-13 06:13 panini 阅读(173) 评论(0) 推荐(0) 编辑
摘要: 题目: Sort a linked list using insertion sort. Hide Tags Linked List Sort Sort a linked list using insertion sort. Hide Tags Linked List Sort Sort a lin 阅读全文
posted @ 2017-06-13 03:44 panini 阅读(100) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. 阅读全文
posted @ 2017-06-13 02:44 panini 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up:Can you solve it without using extra spa 阅读全文
posted @ 2017-06-12 11:26 panini 阅读(116) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. 阅读全文
posted @ 2017-06-11 22:56 panini 阅读(189) 评论(0) 推荐(0) 编辑
摘要: 题目: Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note:Your algorith 阅读全文
posted @ 2017-06-11 10:07 panini 阅读(140) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 31 下一页