leetcode
jecklee
这个作者很懒,什么都没留下…
展开
-
【leetcode题解】4 - Distinct Subsequences
Distinct Subsequences Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by del原创 2014-03-11 01:34:52 · 920 阅读 · 0 评论 -
【leetcode题解】3 - Scramble String
Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great":原创 2014-03-09 18:24:59 · 881 阅读 · 0 评论 -
【leetcode题解】5 - Surrounded Regions
Surrounded Regions Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For原创 2014-03-12 00:40:41 · 1346 阅读 · 1 评论 -
【leetcode题解】1 - Reverse Words in a String
Reverse Words in a String Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". click to show clarification. leetcode原创 2014-03-09 15:30:08 · 1034 阅读 · 0 评论 -
【leetcode题解】2 - Word Search
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 horizonta原创 2014-03-09 17:13:33 · 814 阅读 · 0 评论