码迷,mamicode.com
首页 >  
搜索关键字:unique    ( 4837个结果
Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's...
分类:其他好文   时间:2014-08-18 00:03:13    阅读次数:189
链表的特有算法操作
10.42 使用list的算法实现排序和删除重复元素。#include#include#include#includeusing namespace std;void elimDup(list &words){ words.sort(); words.unique();}bool isS...
分类:其他好文   时间:2014-08-17 22:39:52    阅读次数:269
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....
分类:其他好文   时间:2014-08-17 17:03:22    阅读次数:184
Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be?...
分类:其他好文   时间:2014-08-17 15:39:42    阅读次数:221
《STL源码剖析》---stl_multimap.h阅读笔记
multimap和map的关系和multiset和set关系一样,multimap允许有重复的键值,它在使用底层数据结构红黑树用,插入操作用的是insert_equal,而不是insert_unique。...
分类:其他好文   时间:2014-08-17 11:46:12    阅读次数:262
Tree Operations 打印出有向图中的环
题目: You are given a binary tree with unique integer values on each node. However, the child pointers on each node may point to any other node in the tree including itself, introducing cycles into the...
分类:其他好文   时间:2014-08-17 09:11:11    阅读次数:301
Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num...
分类:其他好文   时间:2014-08-16 17:03:50    阅读次数:174
THINKPHP_动态验证validate()
$data=I(‘post.‘,‘‘,‘trim‘); $rules = array( ???? array(‘name‘,‘‘,‘数据名称已存在‘,0,‘unique‘,1), ???? //array(验证字段1,验证规则,错误提示,[验证条件,附加规则,验证时间]), ???? array(‘ver...
分类:Web程序   时间:2014-08-16 01:12:29    阅读次数:480
[leetcode]Unique Binary Search Trees
Unique Binary Search TreesGivenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a to...
分类:其他好文   时间:2014-08-16 00:59:29    阅读次数:178
[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 pr...
分类:其他好文   时间:2014-08-15 23:44:29    阅读次数:280
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!