码迷,mamicode.com
首页 >  
搜索关键字:letters    ( 1345个结果
[C++]LeetCode: 105 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 ...
分类:编程语言   时间:2015-01-17 18:10:44    阅读次数:251
[LeetCode] Letter Combinations of a Phone Number 回溯
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类:其他好文   时间:2015-01-15 18:08:11    阅读次数:108
[C++]LeetCode: 97 Word Search (深度优先搜索)
题目: Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or ver...
分类:编程语言   时间:2015-01-15 16:14:27    阅读次数:301
(每日算法)LeetCode --- Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total nu...
分类:编程语言   时间:2015-01-13 21:33:22    阅读次数:269
hdu 4622
Problem Description Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the nu...
分类:其他好文   时间:2015-01-12 23:44:24    阅读次数:272
LeetCode No.3 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...
分类:其他好文   时间:2015-01-11 22:58:44    阅读次数:223
[C++]LeetCode: 87 Letter Combinations of a Phone Number
题目: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:D...
分类:编程语言   时间:2015-01-11 14:56:20    阅读次数:236
spoj 8222
8222. SubstringsProblem code: NSUBSTRYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal ...
分类:其他好文   时间:2015-01-10 20:57:29    阅读次数:263
Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjace...
分类:其他好文   时间:2015-01-09 22:05:32    阅读次数:287
[leetcode] Word Search
题目:(Backtrancing)Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent ce...
分类:其他好文   时间:2015-01-08 23:58:14    阅读次数:376
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!