码迷,mamicode.com
首页 >  
搜索关键字:should be repaired    ( 4956个结果
Lintcode: Maximum Subarray III
Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum.The number in each subarray should be contiguou...
分类:其他好文   时间:2015-03-14 12:16:06    阅读次数:198
Lintcode: Maximum Subarray II
Given an array of integers, find two non-overlapping subarrays which have the largest sum.The number in each subarray should be contiguous.Return the ...
分类:其他好文   时间:2015-03-14 06:10:35    阅读次数:198
Partition List
Partition List问题:Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should p...
分类:其他好文   时间:2015-03-13 22:04:02    阅读次数:146
Two Sum
Two Sum  Total Accepted: 70583 Total Submissions: 390661 Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should retur...
分类:其他好文   时间:2015-03-13 18:48:27    阅读次数:167
Two Sum
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 ...
分类:其他好文   时间:2015-03-13 16:13:11    阅读次数:169
leetcode------Swap Nodes in Pairs
标题:Swap Nodes in Pairs通过率:32.5难度:中等Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should retu...
分类:其他好文   时间:2015-03-12 23:58:02    阅读次数:255
【LeetCode】Single Number II
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 using extra memory?...
分类:其他好文   时间:2015-03-12 22:35:49    阅读次数:164
【leetcode】Partition List(middle)
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi...
分类:其他好文   时间:2015-03-12 22:24:40    阅读次数:145
【leetcode】Merge Two Sorted Lists(easy)
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思路:使用伪头部c...
分类:其他好文   时间:2015-03-12 20:49:24    阅读次数:124
URAL 1196. History Exam (二分)
1196. History Exam Time limit: 1.5 second Memory limit: 64 MB Professor of history decided to simplify the examination process. At the exam, every student should write a list of historic ...
分类:其他好文   时间:2015-03-12 19:19:49    阅读次数:164
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!