码迷,mamicode.com
首页 >  
搜索关键字:longest substring    ( 5540个结果
iOS: 在Swift中优雅的实现Substring
在Swift中,当我们想要截取某个字符串时,方法如下:let carNumber = "沪A12345"let startIndex = advance(userCar.carPlateNumber.startIndex, 0)let endIndex = advance(startIndex, 1...
分类:移动开发   时间:2014-10-31 18:57:23    阅读次数:232
poj 3764 The xor-longest Path(字典树)
题目链接:poj 3764 The xor-longest Path 题目大意:给定一棵树,每条边上有一个权值,找出一条路径,使得路径上权值的亦或和最大。 解题思路:dfs一遍,预处理出每个节点到根节点路径的亦或和rec,那么任意路径均可以表示rec[a] ^ rec[b],所以问题 就转换成在一些数中选出两个数亦或和最大,那么就建立字典树查询即可。 #include #in...
分类:其他好文   时间:2014-10-30 23:57:58    阅读次数:424
js中得类GET方法
其实是通过js语句自己建的函数function request(strParame){ var args = new Object(); var query = location.search.substring(1); var pairs = query.split("&...
分类:Web程序   时间:2014-10-30 20:41:51    阅读次数:207
LeetCode Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.找出所有字符串的最长公共前缀。 1 public class Solution { 2 public String lo...
分类:其他好文   时间:2014-10-30 20:40:26    阅读次数:222
POJ2533——Longest Ordered Subsequence(简单的DP)
Longest Ordered SubsequenceDescriptionA numeric sequence of ai is ordered if a1 File Name: poj2533.cpp 3 > Author: Enumz 4 > Mail: 369372123@...
分类:其他好文   时间:2014-10-30 16:56:36    阅读次数:164
[LeetCode] Longest Consecutive Sequence 求解
# 题目 > Given an unsorted array of integers, find the length of the longest consecutive elements sequence. > For example, > Given [100, 4, 200, 1, 3, 2], > The longest consecutive elements sequenc...
分类:其他好文   时间:2014-10-30 12:01:47    阅读次数:221
Leet Code Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For ...
分类:其他好文   时间:2014-10-30 11:46:27    阅读次数:188
POJ 2533 Longest Ordered Subsequence(LIS)
H -LISTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let...
分类:其他好文   时间:2014-10-28 23:49:45    阅读次数:261
java:条件表达式
if (results.length() == 0) { return ""; } else { return results.substring(0, results.length() - 1); } 等价于return (results.length()>0)?(...
分类:编程语言   时间:2014-10-28 10:20:46    阅读次数:239
LeetCode 131 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, given s = "aab", Return [ ["aa","b"],...
分类:其他好文   时间:2014-10-27 15:39:02    阅读次数:227
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!