码迷,mamicode.com
首页 >  
搜索关键字:example 复杂条件查询    ( 17809个结果
内容观察者
需要提供读取短信权限packagecom.example.contentobserver;importandroid.app.Activity;importandroid.content.ContentResolver;importandroid.database.ContentObserver;i...
分类:其他好文   时间:2014-07-29 10:20:18    阅读次数:330
[LeetCode] Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example,...
分类:其他好文   时间:2014-07-28 19:17:14    阅读次数:245
CruiseControl.NET : Configuration Preprocessor
Original link:http://build.sharpdevelop.net/ccnet/doc/CCNET/Configuration%20Preprocessor.htmlFor example: What does "cb:include" mean?Is there any ...
分类:Web程序   时间:2014-07-28 15:33:43    阅读次数:183
Java的递归算法
递归算法设计的基本思想是:对于一个复杂的问题,把原问题分解为若干个相对简单类同的子问题,继续下去直到子问题简单到可以直接求解,也就是说到了递推的出口,这样原问题就有递推得解。 关键要抓住的是: (1)递归出口 (2)地推逐步向出口逼近 样例: example: 求5的阶乘。。 例如以下: Jav.....
分类:编程语言   时间:2014-07-28 14:59:43    阅读次数:190
Minimum Window Substring leetcode java
题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBE....
分类:编程语言   时间:2014-07-28 14:42:23    阅读次数:264
Merge Interval leetcode java
题目:Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].题解:这道题主要....
分类:编程语言   时间:2014-07-28 11:35:20    阅读次数:239
Longest Substring Without Repeating Characters leetcode java
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter....
分类:编程语言   时间:2014-07-28 11:34:30    阅读次数:265
heartbeat 配置两台web服务器高可用集群案例
通过heartbeat配置两台web服务器高可用集群案例:拓扑:web1:192.168.0.101hostname:web1.example.comweb2:192.168.0.102hostname:web2.example.comvip:192.168.0.254nfs服务器:192.168.0.100(存放web页面)注意:1主机名要与uname-n保持一致2.web1与web2主机的date时间保持同..
分类:Web程序   时间:2014-07-28 00:35:20    阅读次数:432
LeetCode——Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. Y...
分类:其他好文   时间:2014-07-28 00:28:19    阅读次数:273
URAL - 1057 Amount of Degrees
Description Create a code to determine the amount of integers, lying in the set [ X; Y] and being a sum of exactly K different integer degrees of B. Example. Let X=15, Y=20, K=2, B=2. By...
分类:其他好文   时间:2014-07-28 00:09:39    阅读次数:347
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!