码迷,mamicode.com
首页 >  
搜索关键字:permutations ii    ( 7008个结果
Week1(11月18日)
Part I:提问===========================代码编写练习1.为用户登录系统编写模型。2.将该模型映射到数据库上。3.编写登录的控制器和视图。Part II:检查===========================1.上堂课的练习效果。Part III:案例学习=====...
分类:其他好文   时间:2014-11-17 12:15:27    阅读次数:194
Leetcode-Permuation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence ...
分类:其他好文   时间:2014-11-17 06:53:34    阅读次数:214
【LeetCode】Palindrome Partitioning II 解题报告
【题目】 Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab...
分类:其他好文   时间:2014-11-16 17:23:33    阅读次数:158
leetcode. Permutations && Permutations II
Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,...
分类:其他好文   时间:2014-11-16 13:20:10    阅读次数:154
nyoj 469
擅长排列的小明 II时间限制:1000ms | 内存限制:65535KB难度:3描述小明十分聪明,而且十分擅长排列计算。有一天小明心血来潮想考考你,他给了你一个正整数n,序列1,2,3,4,5......n满足以下情况的排列:1、第一个数必须是12、相邻两个数之差不大于2你的任务是给出排列的种数。输...
分类:其他好文   时间:2014-11-15 18:53:16    阅读次数:169
LeetCode "Find Minimum in Rotated Sorted Array II"
Similar with version I, but analysis is different. With the possibility of duplication, only ">" indicate a definite case of next search space.class S...
分类:其他好文   时间:2014-11-15 16:56:14    阅读次数:201
[leetcode] 7. Binary Tree Level Order Traversal II
这次相对来讲复杂点,题目如下: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from lea...
分类:其他好文   时间:2014-11-15 01:27:53    阅读次数:174
[leetcode] 7. Binary Tree Level Order Traversal II
这次相对来讲复杂点,题目如下: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from lea...
分类:其他好文   时间:2014-11-15 01:23:35    阅读次数:192
Single Number II (17)
Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp...
分类:其他好文   时间:2014-11-14 22:44:04    阅读次数:231
POJ 2536 Gopher II(二分图最大匹配)
题意:N只地鼠M个洞,每只地鼠、每个洞都有一个坐标。每只地鼠速度一样,对于每只地鼠而言,如果它跑到某一个洞的所花的时间小于等于S,它才不会被老鹰吃掉。规定每个洞最多只能藏一只地鼠。问最少有多少只地鼠会命丧鹰口。思路:直接建图。二分图最大匹配。代码:char st[105];char Range[25...
分类:其他好文   时间:2014-11-13 16:21:31    阅读次数:195
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!