机试模拟题

1.字符集合

#include<bits/stdc++.h>
using namespace std;
int main(){
    string s;
    string res;
    while(cin>>s){
        map<char,int> m;
        for(auto c:s){
            if(m[c]==0){
                res.push_back(c);
                m[c]++;
            }
            else 
            continue;    
        }
        for(int i=0;i<res.size();i++)
        cout<<res[i];
    }
    return 0;
}

2.美团笔试

class Solution {
public:
    int maxsub(vector<int>& nums,int l,int r){
       //int n=r-l+1; 
       int pre=0;
       int maxsum=nums[l];
       for(int i=l;i<=r;i++){
           pre=max(nums[i],pre+nums[i]);
           maxsum=max(maxsum,pre);
       }
       return maxsum;
    }

    int maxSubArray(vector<int>& nums) {
        int n=nums.size();
        int sum=nums[0];
        int left=0,right=n-1;
        for(int i=0;i<n-1;i++){
            int s1=maxsub(nums,left,i);
            cout<<s1<<endl;
            int s2=maxsub(nums,i+1,right);
            cout<<s2<<endl;
            sum=max(sum,s1+s2);
        }
        return sum;
    }
};