string
jerseyma
这个作者很懒,什么都没留下…
展开
-
[Leetcode]#8 String to Integer (atoi)
//#8 String to Integer (atoi)//8ms 100%class Solution {public: int myAtoi(string str) { int result(0); bool negative(false); bool start(false); for(string::i原创 2015-09-02 06:30:18 · 303 阅读 · 0 评论 -
[Leetcode]#58 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 defined as原创 2015-09-02 07:03:12 · 186 阅读 · 0 评论 -
[Leetcode]#6 ZigZag Conversion
//#6 ZigZag Conversion//108ms 4.86%class Solution {public: string convert(string s, int numRows) { vector < vector<char> > v_v; while(!s.empty()) { vecto原创 2015-09-02 06:27:08 · 206 阅读 · 0 评论 -
[Leetcode] #20 Valid Parentheses
//#20 Valid Parentheses//0ms 100%class Solution {public: bool isValid(string s) { vector<char> stk; for(unsigned int i=0; i<s.length(); i++) { //cout << "原创 2015-09-02 06:38:43 · 190 阅读 · 0 评论 -
[Leetcode]#166 Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating, enclose the repeating part in parentheses.For exam原创 2015-09-02 07:50:47 · 201 阅读 · 0 评论 -
[Leetcode]#38 Count and Say
The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2, the原创 2015-09-02 06:57:35 · 175 阅读 · 0 评论 -
[Leetcode]#67 Add Binary
Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”. //#67 Add Binary//172ms 0.47%class Solution {public: string addBinary(string a, s原创 2015-09-02 07:09:15 · 253 阅读 · 0 评论 -
[Leetcode]#60 Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3):"123""132""213""231""312""32原创 2015-09-02 07:04:55 · 253 阅读 · 0 评论 -
[Leetcode]#28 Implement strStr()
//#28 Implement strStr()//4ms 100%class Solution {public: int strStr(string haystack, string needle) { if(needle.empty()) return 0; if(haystack.empty() || needle.empty() ||原创 2015-09-02 06:49:34 · 191 阅读 · 0 评论 -
[Leetcode]#43 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.//#43 Multiply Strings//12ms 56.32%class Sol原创 2015-09-02 06:59:02 · 177 阅读 · 0 评论 -
[Leetcode]#165 Compare Version Numbers
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and conta原创 2015-09-02 07:49:26 · 432 阅读 · 0 评论