摘要：
link class Solution { public: int maxNonOverlapping(vector<int>& nums, int target) { unordered_map<int,int> pos; pos[0]=-1; int sum=0; int n=nums.size 阅读全文
摘要：
link class Solution { public: int longestAwesome(string s) { int n=s.size(); vector<int> dp(1<<10,n); int res=1; dp[0]=-1; int mask=0; for(int i=0;i<n 阅读全文