华为2019软件类笔试

第一题

忘记题目了...复盘不了

#include
#include
#include 
#include 

第二题：0-1背包问题

#include
#include 
#include 
using namespace std;

void split(std::string str,std::string pattern,vector& result)
{
    std::string::size_type pos;

    str+=pattern;
    int size=str.size();

    for(int i=0; i& value,vector& weight)
{
    vector> f(N+1,vector(V+1,0));
    int result=0;
    for(auto i = 1; i <= N; i++)
    {
        for(auto j = 1; j <= V; j++)
        {
            if(j < weight[i])
            {
                f[i][j] = f[i - 1][j];
            }
            else
            {
                int x = f[i - 1][j];
                int y = f[i - 1][j - weight[i]] + value[i];
                f[i][j] = x < y ? y : x;
            }
            if(f[i][j]>result)
                result=f[i][j];
        }
    }

    return result;
}

int main()
{
    string vstr,wstr;
    int c;
    while(cin>>vstr>>wstr) {
        vector v(1, 0);
        vector w(1, 0);
        split(vstr,",",v);
        split(wstr,",",w);
        cin >> c;
        cout << solve(5, c, v, w) << " ";
    }
}

第三题：typedef语句解析

#include
#include
#include 
#include