码迷,mamicode.com
首页 >  
搜索关键字:largest number    ( 27910个结果
PatentTips - Cross-domain data transfer using deferred page remapping
BACKGROUND OF THE INVENTIONThe present invention relates to data transfer across domains, and more particularly, to data transfer across a number of d...
分类:移动开发   时间:2014-06-18 13:55:52    阅读次数:422
[LeetCode] Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:其他好文   时间:2014-06-18 12:51:52    阅读次数:205
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
Letter Combinations of a Phone Number
题目 Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. In...
分类:其他好文   时间:2014-06-18 12:03:16    阅读次数:227
[算法]有趣算法合辑[21-30]
题目21:有一分数序列:2/1,3/2,5/3,8/5,13/8,21/13...求出这个数列的前20项之和。 1.程序分析:请抓住分子与分母的变化规律。 2.程序源代码: main() { int n,t,number=20; float a=2,b=1,s=0; for(n=1;n<=number;n++)  {  s=s+a/b;  t=a;a=a+b;b=t;/*这部分是程序的关键...
分类:其他好文   时间:2014-06-18 11:44:33    阅读次数:176
hdu2665-Kth number
Kth number Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4585    Accepted Submission(s): 1461 Problem Description Give you a sequenc...
分类:其他好文   时间:2014-06-17 23:04:29    阅读次数:246
3Sum Closest
题目 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would ...
分类:其他好文   时间:2014-06-17 22:39:41    阅读次数:274
PKU-2104-K-th Number
K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 36045   Accepted: 11522 Case Time Limit: 2000MS Description You are working for Macrohard com...
分类:其他好文   时间:2014-06-17 22:17:07    阅读次数:410
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
JavaScript Patterns 4.9 Configuration Objects
Passing a large number of parameters is not convenient. A better approach is to substitute all the parameters with only one and make it an object.
分类:编程语言   时间:2014-06-17 20:40:07    阅读次数:185
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!