- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Maximum Product of Word Lengths
class Solution { public: int maxProduct(vector& words) { int n=words.size(); vector dict(n,0); for(int i=0;i<n;++i){ for(char c:words[i]){ dict[
2015-12-16 12:15:32
509
原创 17 Letter Combinations of a Phone Number
class Solution { public: vector<string> letterCombinations(string digits) { vector<string> ans; if(digits==""){ return ans; } string combination="";
2015-12-01 16:55:47
434
原创 16 3Sum Closest
class Solution { public: int threeSumClosest(vector<int>& nums, int target) { int n=nums.size(); int closest=nums[0]+nums[1]+nums[2]; sort(nums.begin(),nums.end());
2015-12-01 16:43:41
345
原创 15 3Sum
class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) { vector<vector<int>> ans; int n=nums.size(); if(n<3){ return ans; } sor
2015-12-01 16:33:28
380
原创 312 Burst Balloons
动态规划：dp[i][j]表示气球i到气球j的最佳coins 动态转移方程： dp[i][j]=max(dp[i][k-1]+nums[i-1]*nums[k]*nums[j+1]+dp[k+1][j]) k∈[i,j]class Solution { public: int maxCoins(vector<int>& nums) { for(int i=0;i<num
2015-12-01 15:41:38
2142
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人