随笔分类 -  leetcode

Longest Substring Without Repeating Characters
摘要：#include #include #include #include #include using namespace std;int lengthOfLongestSubstring(string s) { vector temp(256, -1); int max_l = 0; int begin = 0; for (int i = 0; i < s.size(); ... 阅读全文
posted @ 2016-03-14 22:11 HUSTLX 阅读(143) 评论(0) 推荐(0)
43. Multiply Strings
摘要：string multiply(string num1, string num2) { if (num1 == "0" || num2 == "0") return "0"; int sa = num1.size(); int sb = num2.size(); vector temp(sa + sb, 0); for (int i = sa - 1; i >= 0;... 阅读全文
posted @ 2016-03-08 21:07 HUSTLX 阅读(149) 评论(0) 推荐(0)
66. Plus One
摘要：vector plusOne(vector& digits) { vector res; int carry = 1; for (int i = digits.size() - 1; i >= 0; i--) { int sum = carry + digits[i]; carry = sum / 10; res.push_back(su... 阅读全文
posted @ 2016-03-08 20:15 HUSTLX 阅读(154) 评论(0) 推荐(0)
67. Add Binary
摘要：#include #include #include #include #include using namespace std;string addBinary(string a, string b) { int carry = 0; int len = a.size() > b.size() ? a.size() : b.size(); string res; for ... 阅读全文
posted @ 2016-03-08 19:59 HUSTLX 阅读(173) 评论(0) 推荐(0)
18. 4Sum
摘要：#include #include #include #include #include using namespace std; vector> fourSum(vector& nums, int target) { vector> res; sort(nums.begin(), nums.end()); int len = nums.size(); for (i... 阅读全文
posted @ 2016-03-07 16:48 HUSTLX 阅读(151) 评论(0) 推荐(0)
16. 3Sum Closest
摘要：#include #include #include #include #include using namespace std; int threeSumClosest(vector& nums, int target) { sort(nums.begin(), nums.end()); int len = nums.size(); int min = INT_MAX; ... 阅读全文
posted @ 2016-03-07 14:57 HUSTLX 阅读(177) 评论(0) 推荐(0)
3sum
摘要：#include #include #include #include #include using namespace std;vector> threeSum(vector& nums) { sort(nums.begin(), nums.end()); int len = nums.size(); vector> res; for (int i = 0; i num... 阅读全文
posted @ 2016-03-07 10:22 HUSTLX 阅读(192) 评论(0) 推荐(0)
two sum
摘要：#include #include #include #include using namespace std;vector twoSum(vector& nums, int target) { int len = nums.size(); map temp; vector re; for (int i = 0; i second); re.push_... 阅读全文
posted @ 2016-03-07 09:09 HUSTLX 阅读(171) 评论(0) 推荐(0)
Verify Preorder Serialization of a Binary Tree
摘要：bool isValidSerialization(string preorder) { int len = preorder.size(); vector temp; bool flag = true; for (int i = 0; i 1 && temp[sz - 1] == '#'&&temp[sz - 2] == '#') { temp.p... 阅读全文
posted @ 2016-03-06 14:43 HUSTLX 阅读(190) 评论(0) 推荐(0)