码迷,mamicode.com
首页 >  
搜索关键字:each    ( 14050个结果
Remove Duplicates from Sorted List I&&II
Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, r...
分类:其他好文   时间:2014-10-08 01:26:44    阅读次数:239
Search a 2D Matrix
Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l...
分类:其他好文   时间:2014-10-07 15:03:53    阅读次数:130
HDU 3392 Pie(滚动数组优化)
Problem Description A lot of boys and girls come to our company to pie friends. After we get their information, we need give each of them an advice for help. We know everyone’s height, and we belie...
分类:其他好文   时间:2014-10-07 13:51:13    阅读次数:226
hdu 3455 Leap Frog(状压DP)
Problem Description Jack and Jill play a game called "Leap Frog" in which they alternate turns jumping over each other. Both Jack and Jill can jump a maximum horizontal distance of 10 units in any ...
分类:其他好文   时间:2014-10-07 13:34:33    阅读次数:152
leetcode -- Clone Graph
不要晃荡,找准方向[问题描述]Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes a...
分类:其他好文   时间:2014-10-07 00:20:21    阅读次数:208
Decks
Now that we have Card objects, the next step is to define a class to represent decks. Since a deck is made up cards, a natural choice is for each Deck...
分类:其他好文   时间:2014-10-06 17:49:50    阅读次数:197
N-Queens I&&II
Then-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all distinc...
分类:其他好文   时间:2014-10-06 16:38:20    阅读次数:249
Leetcode: Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each numb...
分类:其他好文   时间:2014-10-06 13:41:10    阅读次数:154
Populating Next Right Pointers in Each Node
[leetcode]Populating Next Right Pointers in Each Node...
分类:其他好文   时间:2014-10-06 12:54:40    阅读次数:183
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution still work? Note: You may only use constant extr...
分类:其他好文   时间:2014-10-06 00:41:19    阅读次数:271
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!