字符串
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
LeetCode | 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 n原创 2016-08-03 20:44:49 · 247 阅读 · 0 评论 -
LeetCode | Implement strStr()
求子串的,暴力O(n*m) 等我看完了KMP算法那些O(m+n),再来考虑这个优化比较有趣的是空串是任意串的子串,并且对于子串长度已经超过父串可以容纳的时候,pass(这个很重要,不然会TLE)class Solution { public: int strStr(string haystack, string needle) { int len=haystack.size(原创 2016-08-03 21:00:28 · 206 阅读 · 0 评论 -
LeetCode | String to Integer
讲道理这道题挺无聊的…各种特判 不过这个代码风格还是可以学习一下的。。。 Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and原创 2016-08-03 21:52:50 · 175 阅读 · 0 评论 -
LeetCode | Add Binary
Given two binary strings, return their sum (also a binary string). For example, a = “11” b = “1” Return “100”. 简单的二进制加法模拟,为了让代码更优雅,模仿了之前高精度和链表加法里面的做法 即 i>=0 || j>=0 再对i、j进行特判给的提示也是这样做的,不过使用了好多函数其原创 2016-08-03 22:11:48 · 186 阅读 · 0 评论 -
LeetCode | 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. 最长回文串问题,网上也有超多的原创 2016-08-04 17:01:24 · 221 阅读 · 0 评论 -
LeetCode | Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 求字符串最长公共前缀,这题也没啥好说的,就代码可读性上说一说好了。我写的虽然也是4ms虽然也没错,但是可读性上来说相对差了一点class Solution { public: string longestCommonPr原创 2016-08-05 00:01:17 · 188 阅读 · 0 评论 -
LeetCode | Valid Number
写到一半不想写了,今天暂且写到这,下次继续。 按照DFA进行判断。无符号整数 无符号小数 class Solution { public: bool isNumber(string s) { return work(s.c_str()); } bool work(const char* s){ //1、忽略前置空格 wh原创 2016-08-05 00:29:48 · 216 阅读 · 0 评论 -
LeetCode | Length of Last Word
没啥好说 ,字符串模拟, 注意从后面去除空格就好 另外,要注意这个平台string越界(-1 或者 大于 s.size())是不会报错的,如果不加pos>=0 会出现输出奇葩的长度,故注意边界控制class Solution { public: int lengthOfLastWord(string s) { int n=s.size(),len=0; i原创 2016-08-05 12:00:42 · 207 阅读 · 0 评论 -
LeetCode | Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le原创 2016-08-07 11:13:16 · 264 阅读 · 0 评论