华为笔试题

最新推荐文章于 2019-09-08 21:56:35 发布

皮得一1

最新推荐文章于 2019-09-08 21:56:35 发布

阅读量391

点赞数 1

分类专栏：互联网笔试

本文链接：https://blog.youkuaiyun.com/u014552756/article/details/89502148

版权

互联网笔试专栏收录该内容

3 篇文章

订阅专栏

本文将分享一次参加华为技术笔试的经历，涵盖了题目类型、难度及解题策略，旨在帮助准备应聘者更好地了解华为笔试流程和备考重点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
using namespace std;


int main()
{
    map<char,int> s;
    string str;
    cin>>str;
    for(int i=0; i<str.length(); i++)
    {
        if(str[i]>='A'&&str[i]<='Z')
            str[i]=str[i]+32;
        s[str[i]]++;
    }
    map<char,int>::iterator iter;
    for(iter=s.begin(); iter!=s.end(); iter++)
        cout<<iter->first<<" "<<iter->second<<endl;
    int k=0;
    int aa[1001];
    if(s['z']!=0)
    {
        for(int i=0; i<s['z']; i++)
            aa[k++]=0;
        s['z']=s['z']-s['z'];
        s['e']=s['e']-s['z'];
        s['r']=s['r']-s['z'];
        s['o']=s['o']-s['z'];
    }
    if(s['w']!=0)
    {
        for(int i=0; i<s['w']; i++)
            aa[k++]=2;
        s['t']=s['t']-s['w'];
        s['o']=s['o']-s['w'];
        s['w']=s['w']-s['w'];
    }
    if(s['u']!=0)
    {
        for(int i=0; i<s['u']; i++)
            aa[k++]=4;
        s['f']=s['f']-s['u'];
        s['o']=s['o']-s['u'];
        s['r']=s['r']-s['u'];
        s['u']=s['u']-s['u'];
    }
    if(s['g']!=0)
    {
        for(int i=0; i<s['g']; i++)
            aa[k++]=8;
        s['e']=s['e']-s['g'];
        s['i']=s['i']-s['g'];
        s['h']=s['h']-s['g'];
        s['t']=s['t']-s['g'];
        s['g']=s['g']-s['g'];

    }
    if(s['h']!=0)
    {
        for(int i=0; i<s['h']; i++)
            aa[k++]=3;
        s['t']=s['t']-s['h'];
        s['r']=s['r']-s['h'];
        s['e']=s['e']-s['h']-s['h'];
        s['h']=s['h']-s['h'];
    }
    if(s['x']!=0)
    {
        for(int i=0; i<s['x']; i++)
            aa[k++]=6;
        s['s']=s['s']-s['x'];
        s['i']=s['i']-s['x'];
        s['x']=s['x']-s['x'];

    }

    if(s['s']!=0)
    {
        for(int i=0; i<s['s']; i++)
            aa[k++]=7;
        s['e']=s['e']-s['s']-s['s'];
        s['v']=s['v']-s['s'];
        s['n']=s['n']-s['s'];
        s['s']=s['s']-s['s'];
    }

    if(s['v']!=0)
    {
        for(int i=0; i<s['v']; i++)
            aa[k++]=5;
        s['f']=s['f']-s['v'];
        s['i']=s['i']-s['v'];
        s['e']=s['e']-s['v'];
        s['v']=s['v']-s['v'];
    }
    if(s['o']!=0)
    {
        for(int i=0; i<s['o']; i++)
            aa[k++]=1;
        s['n']=s['n']-s['o'];
        s['e']=s['e']-s['o'];
        s['o']=s['o']-s['o'];
    }
    if(s['i']!=0)
    {
        for(int i=0; i<s['i']; i++)
            aa[k++]=9;
    }
    sort(aa,aa+k);
    for(int i=0; i<k; i++)
        cout<<aa[i];
    cout<<endl;

    return 0;
}