码迷,mamicode.com
首页 >  
搜索关键字:substring with conca    ( 3920个结果
js中substr与substring的差别
Js的substring和C#的Substring的作用都是从一个字符串中截取出一个子字符串,但它们的用法却有非常大的不同,下边我们来比較看看:Js的substring语法:程序代码String.substring(start, end)说明:返回一个从start開始到end(不包括end)的子字符...
分类:Web程序   时间:2014-07-16 23:20:43    阅读次数:313
Problem Palindrome Partitioning
Problem Description:Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ...
分类:其他好文   时间:2014-07-07 16:02:55    阅读次数:259
LeetCode:Longest Palindromic Substring
Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there...
分类:其他好文   时间:2014-06-30 13:21:00    阅读次数:202
Minimum Window Substring
题目 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 = "ADOBECODEBANC" T = "ABC" Minimum wi...
分类:Windows程序   时间:2014-06-29 20:38:14    阅读次数:239
leetcode--Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:其他好文   时间:2014-06-29 20:28:58    阅读次数:183
[leetcode] 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 fo...
分类:其他好文   时间:2014-06-27 12:48:10    阅读次数:238
[leetcode] Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes...
分类:其他好文   时间:2014-06-27 12:46:45    阅读次数:238
[leetcod]Substring with Concatenation of All Words
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatena...
分类:其他好文   时间:2014-06-27 12:44:16    阅读次数:226
Substring with Concatenation of All Words
题目 You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once an...
分类:其他好文   时间:2014-06-27 10:24:26    阅读次数:219
LeetCode: Palindrome Partitioning [131]
【题目】 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"], ["a","a","b"] ] 【题意】 给定一个字符串s, 要求对s进行...
分类:其他好文   时间:2014-06-26 13:21:59    阅读次数:182
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!