码迷,mamicode.com
首页 >  
搜索关键字:unique paths ii    ( 12050个结果
Rendering Paths
【Rendering Paths】1、在Edit->Project Settings->Player 打开的Inspector中可以设置Rendering Paths。 2、Rendering Paths的值总共有三种: Vertex Lit:少数光照特性,不支持阴影。 Forward w...
分类:其他好文   时间:2014-06-25 16:49:14    阅读次数:245
hdu1027 Ignatius and the Princess II 全排列
STL中的神器next_permutation和prev_permutation函数 全排列...
分类:其他好文   时间:2014-06-24 22:41:03    阅读次数:271
LeetCode: Best Time to Buy and Sell Stock II [122]
【题目】 Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). H...
分类:其他好文   时间:2014-06-24 19:40:53    阅读次数:240
Longest Palindromic Substring
题目 Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 方法 ...
分类:其他好文   时间:2014-06-24 19:36:55    阅读次数:212
Remove Duplicates from Sorted List II [详细分析]
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4->5, return 1->2->5. Given 1->1-...
分类:其他好文   时间:2014-06-22 22:57:49    阅读次数:347
poj1942 Paths on a Grid 【排列组合】
关于这个题想说一下,刚开始准备按照有一个含有n个数的非递减序列,每个数最大值为m,数字可以重复,有多少种这样的序列,像是一个蛮复杂的排列组合 其实这道题,从left bottom到right up只能向右或者向上,也就是m+n个格子里面取m个格子写右,n个格子写上,就成了个很2的排列组合问题 值得强调的是,这个题求组合数是用分数相乘来求的,怕double丢精度可以末尾+0.5然后转化为long...
分类:其他好文   时间:2014-06-22 16:53:21    阅读次数:135
leetcode - Unique Binary Search Trees II
题目:Unique Binary Search Trees IIGivenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your...
分类:其他好文   时间:2014-06-22 13:49:21    阅读次数:243
LeetCode:N-Queens I II(n皇后问题)
N-QueensThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, retu...
分类:其他好文   时间:2014-06-22 13:10:11    阅读次数:188
Codeforces 346C Number Transformation II 构造
题目链接:点击打开链接 = = 990+ms卡过 #include #include #include #include #include #include using namespace std; #define N 100010 #define L(x) (x<<1) #define R(x) (x<<1|1) #define ll int ll n,m,k,a,b; ll x[N]; b...
分类:其他好文   时间:2014-06-22 08:16:57    阅读次数:208
【Leetcode】Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / ...
分类:其他好文   时间:2014-06-21 22:44:58    阅读次数:266
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!