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-10-04 17:14:57
阅读次数：
294
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-10-04 00:21:09
阅读次数：
211
A typical swapping.class Solution {public: /** * @param chars: The letters array you should sort. */ bool isUpper(char c) { r...
分类：
其他好文 时间：
2015-09-22 14:17:34
阅读次数：
156
后缀数组是处理字符串的一种常用算法，是后缀树的一种精巧的替代品，它比后缀树更容易编程实现，且效率和后缀树相当。后缀数组定义子串: 字符串S的子串r[i, j]（i using namespace std;#define MAX_ARRAY_SIZE 1000#define LETTERS 100in...
分类：
编程语言 时间：
2015-09-21 23:45:13
阅读次数：
282
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-09-20 17:40:40
阅读次数：
290
We say a string is beautiful if it has the equal amount of 3 or more continuous letters (in increasing order.)Here are some example of valid beautiful...
分类：
其他好文 时间：
2015-09-18 23:21:04
阅读次数：
279
在Action里的代码为：var letters = new List() { "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "
分类：
Web程序 时间：
2015-09-12 23:44:19
阅读次数：
300
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-09-11 10:41:08
阅读次数：
144
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-09-10 16:05:38
阅读次数：
211
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-09-07 22:50:00
阅读次数：
213
