码迷,mamicode.com
首页 >  
搜索关键字:longest substring wi    ( 8067个结果
substring函数——sql
--substring( expression, start, length ) expression待截取的文字 start 截取位置的起始下标 length 要截取的长度--左边第一个...
分类:数据库   时间:2014-06-27 21:36:26    阅读次数:261
[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
SDUT2013级测试赛_D
题目描述 给出一棵含有n个点的树,每个点权值为wi,求从根节点到叶子结点权值和最大的那条路经的权值和是多少。 输入 n(1。 接下来n+1行,每行两个整数w(w 。 第i个节点的父节点为w,若 i为根节点。600组数据。 输出  对于每组数据,输出一个数代表答案。 示例输入 3 0 5 1 5 1 6 示例输出 11...
分类:其他好文   时间:2014-06-27 10:04:54    阅读次数:211
开发路程(4):C#中的SubString()的用法
先看语法:String.SubString(int index,int length) index:开始位置,从0开始 length:你要取的子字符串的长度例子: 1 using System; 2 using System.Collections.Generic; 3 using Sys...
分类:其他好文   时间:2014-06-26 18:31:49    阅读次数:214
动态规划0—1背包问题
动态规划0-1背包问题Ø 问题描写叙述: 给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为C。问应怎样选择装入背包的物品,使得装入背包中物品的总价值最大?Ø 对于一种物品,要么装入背包,要么不装。所以对于一种物品的装入状态能够取0和1.我们设物品i的装入状态为xi,xi∈ (0....
分类:其他好文   时间:2014-06-26 17:23:41    阅读次数:251
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
LeetCode: Palindrome Partitioning II [132]
【题目】 Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab", Return 1 since the palindrome partitioning ["aa","b"] could b...
分类:其他好文   时间:2014-06-26 07:48:00    阅读次数:259
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!