码迷,mamicode.com
首页 >  
搜索关键字:two sum    ( 31846个结果
树中是否存在路径和为 sum leecode java
https://oj.leetcode.com/problems/path-sum//** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNod...
分类:编程语言   时间:2014-07-01 13:09:20    阅读次数:198
LeetCode:Combinations 题解
Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],...
分类:其他好文   时间:2014-07-01 13:01:01    阅读次数:177
Leetcode:Combinations 生成组合
Combinations: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:[ ...
分类:其他好文   时间:2014-07-01 12:58:20    阅读次数:212
Leetcode:Merge Sorted Array 归并排序
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 gre...
分类:其他好文   时间:2014-07-01 12:51:53    阅读次数:202
Leetcode:Gray Code 格雷码
Gray Code:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the ...
分类:其他好文   时间:2014-07-01 12:42:16    阅读次数:192
X/Open DTP模型与XA协议的学习笔记
最近的任务是里了解XA协议。要了解XA协议,必须先了解X/Open DTP模型,稍微总结一下:X/Open DTP(Distributed Transaction Process)是一个分布式事务模型。这个模型主要使用了两段提交(2PC - Two-Phase-Commit)来保证分布式事务的完整性...
分类:其他好文   时间:2014-07-01 12:28:17    阅读次数:458
[Leetcode]Add Two Numbers
题目 You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it a...
分类:其他好文   时间:2014-07-01 09:11:07    阅读次数:206
uva 766 - Sum of powers(数学+递推)
题目连接:uva 766 - Sum of powers 题目大意:将Sk(n)=∑i=1nik化简成Sk(n)=ak+1nk+1+aknk+?+a0M 解题思路: 已知幂k,并且有(n+1)k=C(kk)nk+C(k?1k)nk?1+?+C(0k)n0结论。 所以令 (n+1)k+1?nk+1=C(kk+1)nk+C(k?1k+1)nk?1+?+C(0k+1)n0 nk...
分类:其他好文   时间:2014-07-01 09:05:15    阅读次数:261
hdu 2818 Building Block(带权并查集)
题目:         链接: 题意: 思路: 代码: #include #include #include using namespace std; const int N = 30030; int root[N]; int sum[N],rank[N];//sum[i]表示i下面的积木个数 int q; int findset(int x) { if(x == r...
分类:其他好文   时间:2014-07-01 08:12:55    阅读次数:178
Oracle创建Physical Standby Database案例
Creating a Physical Standby Database This case is created, operated and followed the steps from oracle online help documentation.  The configuration of the two sites server: Primary Database: [roo...
分类:数据库   时间:2014-07-01 06:22:46    阅读次数:415
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!