码迷,mamicode.com
首页 >  
搜索关键字:find    ( 24186个结果
Maximum Sum Subarray
题目:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2...
分类:其他好文   时间:2015-07-13 22:02:02    阅读次数:142
Find Minimum in Rotated Sorted Array
题目:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.Yo...
分类:其他好文   时间:2015-07-13 21:54:35    阅读次数:109
Find Minimum in Rotated Sorted Array(旋转数组的最小数字)
题目描述:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum eleme...
分类:编程语言   时间:2015-07-13 20:35:20    阅读次数:141
[LeetCode] Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 ...
分类:其他好文   时间:2015-07-13 20:13:08    阅读次数:126
leetCode(36):Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the tota...
分类:其他好文   时间:2015-07-13 18:48:42    阅读次数:103
[LeetCode][Java] First Missing Positive
题目: Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses...
分类:编程语言   时间:2015-07-13 18:47:35    阅读次数:148
[LeetCode]236.Lowest Common Ancestor of a Binary Tree
题目Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v a...
分类:其他好文   时间:2015-07-13 18:43:52    阅读次数:75
ecmall 数据库操作
$model为实例化模型对象;1.查询一条数据//$id 主键值$model->get_info($id);2.查询多条数据 并分页$page = $this->_get_page();$datas = $model->find(array('conditions' => '1=1' . $cond...
分类:数据库   时间:2015-07-13 18:31:03    阅读次数:130
[leedcode 64] Minimum Path Sum
Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo...
分类:其他好文   时间:2015-07-13 18:02:11    阅读次数:127
启动erlang/OTP里面的Web服务器(补充)
为了避免参数都在命令行中导致太长,或者不能玩一些高级配置;可以使用inets的配置文件,OTP项目已经有各种配置文件的例子:[root@whyang ~]# cd otp_src_17.5/lib/inets/[root@whyang inets]# find . -type f -name *.c...
分类:Web程序   时间:2015-07-13 17:43:07    阅读次数:142
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!