原题地址:https://oj.leetcode.com/problems/unique-paths/题意:A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The ...
分类:
编程语言 时间:
2014-06-15 23:37:55
阅读次数:
311
原题地址:https://oj.leetcode.com/problems/unique-paths-ii/题意:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many ...
分类:
编程语言 时间:
2014-06-15 23:33:26
阅读次数:
353
原题地址:https://oj.leetcode.com/problems/minimum-window-substring/题意:Given a string S and a string T, find the minimum window in S which will contain all...
分类:
编程语言 时间:
2014-06-15 22:10:42
阅读次数:
1109
原题地址:https://oj.leetcode.com/problems/merge-two-sorted-lists/题意:Merge two sorted linked lists and return it as a new list. The new list should be made...
分类:
编程语言 时间:
2014-06-15 21:58:31
阅读次数:
238
原题地址:https://oj.leetcode.com/submissions/detail/5341904/题意:The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of ...
分类:
编程语言 时间:
2014-06-15 21:33:16
阅读次数:
270
原题地址:https://oj.leetcode.com/problems/reverse-nodes-in-k-group/题意:Given a linked list, reverse the nodes of a linked listkat a time and return its mod...
分类:
编程语言 时间:
2014-06-15 21:24:43
阅读次数:
293
1、
??
Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,
Given n = 3, your program should return all 5 uni...
分类:
其他好文 时间:
2014-06-15 09:09:00
阅读次数:
256
http://acm.hdu.edu.cn/game/entry/problem/list.php?chapterid=1§ionid=21.2.5
#include
/*
题意:找闰年。
if((i%4==0 && i%100!=0) || i%400==0)count++;
3
2005 25
1855 12
2004 10000
2108
1904
43236
*/
int ma...
分类:
其他好文 时间:
2014-06-14 06:32:08
阅读次数:
320
求一个排列的下一个排列。1,2,3→1,3,23,2,1→1,2,31,1,5→1,5,1#include
#include #include using namespace std; class Solution{public: void
nextPermutation(vector &nu...
分类:
其他好文 时间:
2014-06-13 16:41:56
阅读次数:
173
Say you have an array for which theithelement
is the price of a given stock on dayi.If you were only permitted to complete at
most one transaction (ie...
分类:
其他好文 时间:
2014-06-13 15:55:47
阅读次数:
273