leetcoder
文章平均质量分 79
shancoder
菜鸟
展开
-
LeetCode 解题报告 LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if原创 2014-11-03 23:41:21 · 481 阅读 · 0 评论 -
LeetCoder 解题报告 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c原创 2015-02-26 20:40:21 · 475 阅读 · 0 评论 -
LeetCode 解题报告 Reverse Words in a String
题目描述:Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Clarification:What原创 2014-07-30 17:35:20 · 452 阅读 · 0 评论 -
LeetCode 解题报告 LinkedListCycleII
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 space?分析:题目中原创 2014-11-09 12:45:36 · 414 阅读 · 0 评论 -
LeetCode 解题报告 LargestNumber
Largest Number Total Accepted: 6514 Total Submissions: 43968My SubmissionsQuestion Solution Given a list of non negative integers, arrange them such that they form the largest nu原创 2015-01-30 17:00:12 · 568 阅读 · 0 评论 -
LeetCode 解题报告 Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].分析:同样也是用原创 2014-11-06 21:38:09 · 398 阅读 · 0 评论 -
LeetCode 解题报告 Copy List With Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.分析:复杂原创 2014-11-10 11:56:03 · 377 阅读 · 0 评论 -
LeetCode 解题报告 Dungeon Game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially p原创 2015-02-04 22:07:27 · 537 阅读 · 0 评论 -
LeetCode 解题报告 Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.刚拿到这个题的时候一看是计算集合,心里就有些原创 2014-10-30 21:39:50 · 474 阅读 · 0 评论 -
LeetCode 解题报告 Maximum Product Subarray
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,4],the contiguous subarray [2,3] has the largest原创 2014-10-28 17:58:42 · 487 阅读 · 0 评论 -
LeetCode 解题报告 Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2014-11-13 09:27:10 · 1057 阅读 · 0 评论 -
LeetCode 解题报告 Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2015-02-26 16:17:34 · 559 阅读 · 0 评论 -
LeetCode 解题报告 Sort List
Sort a linked list in O(n log n) time using constant space complexity.分析:对链表进行排序,如果是单链表用归并排序时最快的,并且在对数组进行归并的时候是需要用到O(n)的空间的,但是链表就不需要了,只要有O(1)的空间就够了,因为不需要辅助变量来存储。首先是递归的将链表拆分开,然后将链表进行合并。下面是代码:原创 2014-11-02 16:30:35 · 403 阅读 · 0 评论 -
LeetCode 解题报告 Reorder List
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.For example,Given {1,2,3,4}, reorder it t原创 2014-11-07 13:58:56 · 402 阅读 · 0 评论 -
LeetCode 解题报告 Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using e原创 2014-11-10 15:34:15 · 434 阅读 · 0 评论 -
LeetCode 解题报告 Single NumberII
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2014-11-11 10:29:37 · 397 阅读 · 0 评论 -
LeetCode 解题报告 Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].分析:不用原创 2014-11-06 11:01:12 · 386 阅读 · 0 评论 -
LeetCode 解题报告 3Sum Closest
分析:上一个题的解题思路是遍历一个数,剩下的两个数分别指向开头和结尾,根据两数之和的大小,决定两个数向中间移动取值。对于这个题,我们也是用这种思路来解决,只是要注意的一个地方就是,答案不是一个确定的值,是一个最相近的值,所以我们需要保存一个最小值,如果遇到更小的就更新这个最小值,最后的结果就保证了是一个最小值。还需要注意的一个地方是,数值有可能取正也取负,所以我们需要取绝对值来比较大小。原创 2015-02-27 11:23:40 · 508 阅读 · 0 评论