码迷,mamicode.com
首页 >  
搜索关键字:maximum number of th    ( 33896个结果
LeetCode--Single Number II
思路:统计每位出现的次数,mod3;对于k同样适用 1 class Solution { 2 public: 3 int singleNumber(int A[], int n) { 4 int a[32] = {0}; 5 int i = 0; 6 ...
分类:其他好文   时间:2014-07-31 13:14:46    阅读次数:140
HDU 2141 Can you find it?
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbe...
分类:其他好文   时间:2014-07-31 12:54:46    阅读次数:704
基础语句
基础语句 #region switch case // int Number=char.Parse(Console.ReadLine()); // switch (Number) //{ // case 1: // Console.WriteLine("1"); // break; /...
分类:其他好文   时间:2014-07-31 09:48:06    阅读次数:305
LeetCode "Combination Sum II"
The only difference with version I is: one number can only be used once:class Solution {public: vector > ret; struct Rec { Rec() : sum...
分类:其他好文   时间:2014-07-31 05:22:25    阅读次数:239
Letter Combinations of a Phone Number leetcode java
题目:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the tele....
分类:编程语言   时间:2014-07-31 05:22:05    阅读次数:307
Maximum Depth of Binary Tree leetcode java
题目: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 farthes....
分类:编程语言   时间:2014-07-31 02:41:15    阅读次数:229
Minimum Depth of Binary Tree leetcode java
题目:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the neares....
分类:编程语言   时间:2014-07-31 02:30:25    阅读次数:264
Nova分析(1)——整体架构
Conceptual DiagramLogical diagramNova is the most complicated and distributed component of OpenStack. A large number of processes cooperate to turn en...
分类:其他好文   时间:2014-07-30 23:40:55    阅读次数:464
Simple GDB case
to be added...gdb a.out[Inferior 1 (process 9718) exited with code 05](gdb) listLine number 15 out of range; t.c has 14 lines.(gdb) list 11 #include2 ...
分类:数据库   时间:2014-07-30 23:33:25    阅读次数:352
HDU 2830 Matrix Swapping II
Problem Description Given an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we define the maximum area of such rectangle as thi...
分类:移动开发   时间:2014-07-30 20:48:34    阅读次数:260
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!