码迷,mamicode.com
首页 >  
搜索关键字:note    ( 7358个结果
4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note: Element...
分类:其他好文   时间:2015-02-04 18:44:19    阅读次数:127
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ...
分类:其他好文   时间:2015-02-04 18:03:07    阅读次数:163
[LeetCode]64.Minimum Path Sum
【题目】 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down o...
分类:其他好文   时间:2015-02-04 16:34:20    阅读次数:140
3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a triplet (a,b,c...
分类:其他好文   时间:2015-02-04 14:46:28    阅读次数:151
android 5.0 让主菜单的背景显示为壁纸
1、 AppsCustomizePagedView.java修改两处如下: 1)  private void setupPage(AppsCustomizeCellLayout layout) {         layout.setGridSize(mCellCountX, mCellCountY);         // Note: We force a measure here to ...
分类:移动开发   时间:2015-02-04 12:59:33    阅读次数:183
Geos installation on centos6
sudo yum install php-develcd /usr/sharesudo wget http://download.osgeo.org/geos/geos-3.3.9.tar.bz2 # Note this changessudo tar -xvjf geos-3.3.9.tar.b....
分类:其他好文   时间:2015-02-04 10:49:02    阅读次数:191
【区间覆盖问题】uva 10020 - Minimal coverage
可以说是区间覆盖问题的例题...Note:区间包含+排序扫描; 要求覆盖区间[s, t]; 1、把各区间按照Left从小到大排序,如果区间1的起点大于s,则无解(因为其他区间的左起点更大);否则选择起点在s的最长区间; 2、选择区间[li, ri]后,新的起点应更新为ri,并且忽略所有区间在r...
分类:其他好文   时间:2015-02-04 10:48:30    阅读次数:224
leetcode.18--------------4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note: Element...
分类:其他好文   时间:2015-02-04 09:34:11    阅读次数:193
LeetCode[Tree]: Populating Next Right Pointers in Each Node II
Follow up for problem “Populating Next Right Pointers in Each Node”.  What if the given tree could be any binary tree? Would your previous solution still work?  Note: You may only use constant ex...
分类:其他好文   时间:2015-02-03 17:13:39    阅读次数:156
Multiply Strings
Multiply StringsGiven two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large ...
分类:其他好文   时间:2015-02-03 16:31:41    阅读次数:125
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!