摘要:
class Solution { public: int get_buckets(vector<int> &nums,int volume){ int buckets = 1; int ans = 0; for (auto num:nums){ ans += num; if(ans > volume 阅读全文
摘要:
class Solution { public: int longestPalindromeSubseq(string s) { int n=s.size(); int dp[n][n]; memset(dp,0,sizeof(dp)); for(int i=0; i<n;i++)dp[i][i] 阅读全文
摘要:
class Solution { int f[505][505]; public: int maxDotProduct(vector<int>& nums1, vector<int>& nums2) { int m=nums1.size(),n=nums2.size(); int ans=-1e9; 阅读全文
摘要:
class Solution { public: string removeKdigits(string num, int k) { int n=num.size(); string ans; int p=0; int c=n-k;//挑c个 for(int i=0;i<c;i++){ string 阅读全文