字符串
JohnWill_
小白一个,慢慢成长....
展开
-
Palindrome Partitioning 1 拆分回文串
题目描述Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.含义:指定字符串 s,返回 s 所有可能的子串,每个子串必须是一个回文(指顺读和倒读都一样的字符串).For exa...原创 2018-03-22 17:15:38 · 227 阅读 · 0 评论 -
interleaving string-交叉字符串
题目Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", return false.【解析】...原创 2018-03-29 15:01:36 · 157 阅读 · 0 评论 -
Multiply Strings 数字字符串相乘
题目描述Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. 以字符串的形式给定两个数字,返回相乘的结果,注意:结果也是字符串,因为数...原创 2018-04-12 10:47:07 · 277 阅读 · 0 评论 -
Implement strStr() 实现strStr()函数
题目描述Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 这道题让我们在一个字符串中找另一个字符串第一次出现的位置,那我们首先要做一些判断,如果子字符串为空,则返回0,如果子字符串长度大...原创 2018-04-17 22:52:06 · 509 阅读 · 0 评论 -
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 and wit...原创 2018-04-17 20:17:40 · 188 阅读 · 0 评论 -
Edit Distance
概念编辑距离的作用主要是用来比较两个字符串的相似度的基本的定义如下所示:编辑距离,又称Levenshtein距离(莱文斯坦距离也叫做Edit Distance),是指两个字串之间,由一个转成另一个所需的最少编辑操作次数,如果它们的距离越大,说明它们越是不同。许可的编辑操作包括将一个字符替换成另一个字符,插入一个字符,删除一个字符。这个概念是由俄罗斯科学家Vladimir Levenshtein在1...原创 2018-04-07 12:11:56 · 117 阅读 · 0 评论 -
Valid Parentheses
题目描述Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid. The brackets must close in the correct order,"()"and"()[]{}"are all valid but"...原创 2018-04-18 22:54:41 · 101 阅读 · 0 评论 -
Longest Common Prefix 最长公共前缀
题目描述Write a function to find the longest common prefix string amongst an array of strings. 题意:求多个字符串的最长公共前缀.分析:一位一位判断即可.实现代码: class Solution {public: string longestCommonPrefix(vector&...原创 2018-04-23 19:58:04 · 116 阅读 · 0 评论 -
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 ...原创 2018-04-19 21:26:20 · 79 阅读 · 0 评论 -
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 longest palindromic substring. 时间复杂度为O(N²)的算法-动态规...原创 2018-04-20 14:06:36 · 121 阅读 · 0 评论 -
ZigZag Conversion 之字形转换
题目描述The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H NA P L S I...原创 2018-04-20 21:12:14 · 350 阅读 · 0 评论 -
String to Integer (atoi)
题目描述Implement atoi to convert a string to an integer. 实现代码: class Solution {public: int atoi(const char *str) { string s(str); if (s.empty()) return 0; long int...原创 2018-04-21 16:16:21 · 129 阅读 · 0 评论 -
最小窗口子串
题目描述Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S ="ADOBECODEBANC"T ="ABC" Minimum window is"BANC". No...原创 2018-04-04 21:18:22 · 434 阅读 · 0 评论 -
Longest Valid Parentheses
题目描述Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring. For"(()", the longest valid parentheses substring is"()", whic...原创 2018-04-17 14:29:58 · 93 阅读 · 0 评论 -
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 verti...原创 2018-04-04 10:18:23 · 131 阅读 · 0 评论 -
Palindrome Partitioning II 基于动态规划DP
题目描述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",Return1since ...原创 2018-03-23 09:24:31 · 218 阅读 · 0 评论 -
Word-Ladder 广度优先搜索
题目描述Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a time Each interme...原创 2018-03-23 20:41:32 · 187 阅读 · 0 评论 -
存储合法IP地址(Restore IP Addresses)
题目描述Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given"25525511135", return["255.255.11.135", "255.255.111.35"]. (Order...原创 2018-03-30 09:12:14 · 204 阅读 · 0 评论 -
Reverse Linked List II
题目描述Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given1->2->3->4->5->NULL, m = 2 and n = 4, return1->4->3->2->5->NULL. N...原创 2018-03-30 10:24:06 · 109 阅读 · 0 评论 -
Valid Palindrome 正确回文
题目描述Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Panama"is a palindrome. "race a car"is not a...原创 2018-03-24 17:32:55 · 137 阅读 · 0 评论 -
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 where path ...原创 2018-04-07 14:20:37 · 492 阅读 · 0 评论 -
valid-number有效数字判定
题目描述Validate if a given string is numeric. Some examples: "0"=>true " 0.1 "=>true "abc"=>false "1 a"=>false "2e10"=>true Note: It is intended for the problem stateme原创 2018-04-07 19:33:15 · 353 阅读 · 0 评论 -
add-binary
题目描述Given two binary strings, return their sum (also a binary string). For example, a ="11" b ="1" Return"100". 实现代码: class Solution {public: string addBinary(string a, string ...原创 2018-04-07 22:15:09 · 160 阅读 · 0 评论 -
length-of-last-word
题目描述Given a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string. If the last word does not exist, return 0. Note: A word is ...原创 2018-04-09 16:30:23 · 83 阅读 · 0 评论 -
anagrams
题目描述Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. 实现代码: class Solution {public: vector<string> ret; ...原创 2018-04-10 17:23:46 · 220 阅读 · 0 评论 -
Wildcard Matching 外卡匹配
题目描述Implement wildcard pattern matching with support for'?'and'*'. '?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t...原创 2018-04-11 11:08:43 · 467 阅读 · 0 评论 -
Regular Expression Matching 正则表达式匹配和递归
题目描述Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input str...原创 2018-04-21 21:12:20 · 152 阅读 · 0 评论