码迷,mamicode.com
首页 >  
搜索关键字:intersection of two    ( 11974个结果
[LeetCode] Median of Two Sorted Arrays
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be ...
分类:其他好文   时间:2014-06-18 17:39:11    阅读次数:260
(转)python set 用法
转载自:http://hi.baidu.com/????_xu/blog/item/5b9650c513bd3f049d163d8b.htmlpython的set和其他语言类似, 是一个 基本功能包括关系测试和消除重复元素. 集合对象还支持union(联合),intersection(交), dif...
分类:编程语言   时间:2014-06-18 14:30:05    阅读次数:243
[LeetCode] Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an...
分类:其他好文   时间:2014-06-18 12:32:58    阅读次数:169
Two Sum
题目 Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the...
分类:其他好文   时间:2014-06-18 12:05:44    阅读次数:244
LeetCode:Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional ele...
分类:其他好文   时间:2014-06-17 23:05:13    阅读次数:246
LeetCode:Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitted...
分类:其他好文   时间:2014-06-17 21:43:38    阅读次数:219
Divide Two Integers
题目 Divide two integers without using multiplication, division and mod operator. 方法 将除数倍加,直到大于被除数。 public int divide(int dividend, int divisor) { int flag = 0; if...
分类:其他好文   时间:2014-06-16 19:08:08    阅读次数:200
[LeetCode] Combinations [38]
题目 Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],...
分类:其他好文   时间:2014-06-15 14:10:54    阅读次数:239
HDU 1661 Assigments 贪心法题解
Problem Description In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj ti...
分类:其他好文   时间:2014-06-15 11:26:42    阅读次数:195
oracle 11g ocr 冗余配置
在11g 安装过程中默认只能指定一个 dg 用来存储:crs ,voting 但是oracle 官方一般建议我们这么来配置: ■  1、当ocr没有配置镜像,或者冗余存储时 最少3个ocr 。 如果底层存储不是RAID的话,oracle建议镜像OCR,镜像可以避免单点故障。 ■ At least two OCR locations if OCR is configured on...
分类:数据库   时间:2014-06-14 12:29:52    阅读次数:447
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!