码迷,mamicode.com
首页 >  
搜索关键字:pascals triangle ii    ( 7733个结果
[leetcode]Pascal's Triangle
Pascal's TriangleGivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,...
分类:其他好文   时间:2014-07-22 22:48:13    阅读次数:174
Search in Rotated Sorted Array II leetcode java
题目:Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a funct....
分类:编程语言   时间:2014-07-22 22:47:55    阅读次数:214
[leetcode]Triangle
TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given...
分类:其他好文   时间:2014-07-22 22:47:52    阅读次数:230
[LeetCode] Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.以下为补充知识,百度到的罗马数字写法:个位数举例I, 1 】II, 2】 III, 3】...
分类:其他好文   时间:2014-07-22 00:04:34    阅读次数:190
HDU1027 Ignatius and the Princess II 【next_permutation】【DFS】
Ignatius and the Princess II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4571    Accepted Submission(s): 2733 Problem Descriptio...
分类:其他好文   时间:2014-07-21 23:21:04    阅读次数:424
HDU3567:Eight II(康拓展开+预处理)
Problem Description Eight-puzzle, which is also called "Nine grids", comes from an old game.  In this game, you are given a 3 by 3 board and 8 tiles. The tiles are numbered from 1 to 8 and each ...
分类:其他好文   时间:2014-07-21 16:22:02    阅读次数:264
动态规划第五讲——leetcode上的题目动态规划汇总(上)
本节,我们将对leetcode上有关DP问题的题目做一个汇总和分析。 1.题目来源 Interleaving String 动态规划 二叉树 Unique Binary Search Trees 动态规划 二叉树 Word Break 动态规划 N/A Word Break II 动态规划 N/A Palindrome Partitioning 动态规划 N/A ...
分类:其他好文   时间:2014-07-21 15:47:05    阅读次数:232
动态规划第五讲——leetcode上的题目动态规划汇总(上)
本节,我们将对leetcode上有关DP问题的题目做一个汇总和分析。 1.题目来源 Interleaving String 动态规划 二叉树 Unique Binary Search Trees 动态规划 二叉树 Word Break 动态规划 N/A Word Break II 动态规划 N/A Palindrome Partitioning 动态规划 N/A ...
分类:其他好文   时间:2014-07-21 15:21:05    阅读次数:189
LeetCode_39combinationSum2 [Combination Sum II]
#pragma warning(disable:4996) #include <Windows.h> #include <tchar.h> #include <cstdio> #include <vector> using namespace std; /* submit time : 3 1. Runtime Error Last executed input: [5,3]...
分类:其他好文   时间:2014-07-21 13:26:03    阅读次数:250
LeetCode "N-Queens II"
Classic recursion\pruning problem. We can use O(n) space: A[i] = j means [i,j] is occupied.class Solution {public: int ret; bool isValid(int *A,...
分类:其他好文   时间:2014-07-21 11:08:20    阅读次数:240
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!