2017年2月8日
leetcode 17 Letter Combinations of a Phone Number
摘要： class Solution { public: vector<string> letterCombinations(string digits) { vector<string> res; if (digits.empty()) return res; string dict[] = {"abc" 阅读全文
posted @ 2017-02-08 22:27 王坤1993 阅读(134) 评论(0) 推荐(0) 编辑
leetcode 11 Container With Most Water
摘要：  阅读全文
posted @ 2017-02-08 00:07 王坤1993 阅读(132) 评论(0) 推荐(0) 编辑
leetcode 16 3Sum Closest
摘要： class Solution { public: int threeSumClosest(vector<int>& nums, int target) { int closest = nums[0] + nums[1] + nums[2]; int diff = abs(closest - targ 阅读全文
posted @ 2017-02-08 00:03 王坤1993 阅读(101) 评论(0) 推荐(0) 编辑