String
文章平均质量分 66
benbenab
这个作者很懒,什么都没留下…
展开
-
字符串空格换“%20”
void replace(char *str, int length){ if (str == NULL) return; int len = 0; char* head = str; while (*head != '\0'){ if (*head == ' ') len += 3; else len++; } i转载 2012-11-21 05:05:01 · 357 阅读 · 0 评论 -
[leetcode] 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 deleting some (can be n原创 2013-01-05 06:04:29 · 388 阅读 · 0 评论 -
permutation 各种问题
1. Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest p原创 2012-12-06 04:53:30 · 937 阅读 · 0 评论 -
Segment a long string into a set of valid words using a dictionary
http://thenoisychannel.com/2011/08/08/retiring-a-great-interview-problem/有牛人能给解释一下为什么是O(2^n) 和 O(n^2)?转载 2013-01-15 13:24:06 · 461 阅读 · 0 评论 -
【leetcode】 generate parenthesis !!
class Solution { private: vector ret; public: void solve(int dep, int maxDep, int leftNum, int leftNumTotal, string s) { if (leftNumTotal * 2 > maxDep) return;转载 2013-01-24 14:12:57 · 436 阅读 · 0 评论 -
[leetcode] simplify path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case w原创 2013-01-23 10:54:05 · 395 阅读 · 0 评论 -
[leetcode]longest Valid Parentheses(!!)
class Solution {public: int longestValidParentheses(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int nSize = s.size();转载 2013-01-08 06:00:56 · 356 阅读 · 0 评论 -
给定两个字符串,求相同char
string Notsame(const string& a, const string& b){set charInA;string result;if (a.size() == 0)return b;if (b.size()==0)return result;for(int i = 0; i< a.size(); i++)charInA.insert(a[i]);for原创 2012-11-02 10:33:07 · 400 阅读 · 0 评论 -
[leetcode] anagrams
Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.这题原本思路搞得很复杂:1.统计每个string中每个字符的出现次数,然后用“a1b5y4”的形式表示每个字符串。------>其实只要复制string到一个原创 2012-12-22 11:50:57 · 409 阅读 · 0 评论 -
expression 5+4*(7-15) or have parenthesis in any order // 波兰表示法
Answers write code in java /c for expression 5+4*(7-15) or have parenthesis in any order .idea: Use two stack, one for number, one for operator. Every time push a number or an operation into stack.原创 2012-12-16 22:53:57 · 484 阅读 · 0 评论 -
edit distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a w原创 2012-12-20 03:43:20 · 361 阅读 · 0 评论 -
[leetcode] combination (不会做)
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4转载 2012-12-31 05:08:40 · 382 阅读 · 0 评论 -
longest Palindrome substring
class Solution {public: string longestPalindrome(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int len = s.size(); int原创 2012-12-22 10:39:27 · 439 阅读 · 0 评论 -
[leetcode ] 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 vertically原创 2013-03-01 03:20:16 · 403 阅读 · 0 评论