牛客网题库公司真题 2021阅文C++方向笔试卷答案

牛客网题库公司真题技术(软件)信息技术类 C++工程师 2021阅文C++方向笔试卷

以上的标题就是牛客网这个试卷的位置，链接在这里不确定以后是不是有效，我自己做个记录的：2021阅文C++方向笔试卷

2021年春招又加了很多试卷这个要往后翻几页了，这是我2020年底无聊做的，我就分享一下。（有的输入输出的循环题目字面没说循环几次而我给了for循环几次是因为是试错试出来的，这个循环大可不必限制次数）。我是主要是STL来解决的，有几个是C++语法题。

看题：

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <sstream>using namespace std;
class A{public:A(int x,int y):m_x(x),m_y(y){}bool operator==(A const& that)const{return m_x==that.m_x && m_y==that.m_y;}int m_x;int m_y;
};void printMax(vector<A> vs,int temp){vector<int> v;typedef vector<A>::iterator IT;typedef vector<int>::iterator I;for(IT it = vs.begin();it!=vs.end();++it){if((*it).m_y==temp)v.push_back((*it).m_x);}int tmp = 1;for(I i=v.begin();i!=v.end();++i){tmp = tmp>(*i)?tmp:(*i);}cout << tmp << endl;
}int main()
{typedef vector<A>::iterator  IT;string input;int temp = 1;getline(cin,input);stringstream stringin(input);int num;vector<A> vs;while(stringin >> num){if(vs.empty())vs.push_back(A(num,1));else{IT fit = find(vs.begin(),vs.end(),A(num,1));if(fit != vs.end()){if(temp<++(*fit).m_y){temp=(*fit).m_y;}}else{vs.push_back(A(num,1));}}}printMax(vs,temp);return 0;
}

#include <iostream>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <vector>
using namespace std;
class CMP{public:bool operator()(int const& a,int const& b){return a > b;}
};int main()
{vector<int> vs;typedef vector<int>::iterator IT;unsigned int temp=0;string input;cin >> temp;cin.ignore();getline(cin,input);stringstream stringin(input);int num = 0,max = 0;while (stringin >> num) {if(vs.empty()){vs.push_back(num);max = num;}else{vs.push_back(num);max= max>num?max:num;}}CMP cmp;sort(vs.begin(),vs.end(),cmp);IT it = vs.begin();for(int i =0;i<(int)temp;++i){++it;}cout << (*it) <<endl;return 0;
}

#include <iostream>
using namespace std;
class ScopedPtr {public:static ScopedPtr& getInstance(){return s_instance;}ScopedPtr(int* m_b=NULL):m_a(m_b){}private:int *m_a;friend int& operator*(ScopedPtr&);static ScopedPtr s_instance;//指针
};ScopedPtr ScopedPtr::s_instance;int&  operator *(ScopedPtr& d){return *(d.m_a);
}void test(int n) {ScopedPtr ptr(new int(n));*ptr *= 2;std::cout << *ptr << std::endl;
}int main () {int n = 0;std::cin >> n;test(n);return 0;
}

#include <iostream>
#include <bitset>
using namespace std;
class ITOB{public:ITOB(int num=0):m_num(num){}void itob(){if(m_num <= 0xff){char s_num  = (char)m_num;s_num = (s_num | 0x80);bitset<8> bs(s_num);cout <<  bs << endl;}else if((m_num >= 0xff) && (m_num <= 0xffff)){char s1 = (char)(m_num | 0x80);char s2 = (m_num >> 7 & 0xff) & 0x7F;bitset<8> bs1(s1);bitset<8> bs2(s2);cout <<  bs2 << bs1 << endl;}}int m_num;
};int main()
{ITOB ib;cin >> ib.m_num;ib.itob();return 0;
}

#include <iostream>
#include <vector>
#include <list>
#include <sstream>
#include <cstring>
using namespace std;
int main()
{string input;list<string> ls(0);typedef list<string>::iterator IT;vector<int> vs(0);typedef  vector<int>::iterator VT;for(int i=0;i<9;++i){getline(cin,input);ls.push_back(input);}for(IT it = ls.begin();it!=ls.end();++it){string buff;;stringstream stringin(*it);stringin >> buff;if(buff == "push"){int num = 0;stringin >> num;vs.push_back(num);cout << vs.size() << endl;}else if(buff == "pop"){if(vs.empty()){cout << -1 << endl;}else{VT vt = vs.end();--vt;cout << *vt << endl;vs.erase(vt);}}else if(buff == "get"){int num=0;stringin >> num;if((num > int(vs.size())) || (num<0)){cout << -1 << endl;}else{cout << vs[num] << endl;}}}return 0;
}

#include <iostream>
#include <string>
class A {public:A(std::string x = ""):_s(new std::string(x)){//构造函数}A(A&& that){//移动构造if(that._s != nullptr){_s=that._s;that._s = nullptr;}}~A(){//析构函数delete _s;}A& operator=(A&& that){//移动赋值if(this!=&that){std::string a = "";std::string* b = new std::string(a);if(_s != b){delete _s;_s = nullptr;}_s = new std::string;_s = that._s;delete b;}that._s=nullptr;return* this;}std::string s() const {return *_s;}private:std::string *_s;
};int main() {std::string input;std::cin >> input;A a(input);A b(std::move(a));std::cout << b.s() << std::endl;A c;c = std::move(b);std::cout << c.s() << std::endl;return 0;
}

#include <iostream>
#include <cstring>
#include <stack>
using namespace std;
int main()
{stack<char> x;string input;int a = 0;getline(cin,input);const char* c = input.c_str();for(int i = 0;c[i]!='\0';++i){if(c[i]=='('){x.push(c[i]);}else if(c[i]=='['){x.push(c[i]);}else if(c[i]=='{'){x.push(c[i]);}else if(c[i]==')'){if(!x.empty()){if(x.top()=='('){x.pop();}else{--a;    }}else{--a;}}else if(c[i]==']'){if(!x.empty()){if(x.top()=='['){x.pop();}else{--a;    }}else{--a;}}else if(c[i]=='}'){if(!x.empty()){if(x.top()=='{'){x.pop();}else{--a;    }}else{--a;}}}if((x.size()==0)&&(a==0)){cout << "true" << endl;}else{cout <<"false" << endl;}return 0;
}

#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main()
{vector<int> vs;string input;getline(cin,input);stringstream s(input);int num;while(s>>num){vs.push_back(num);}typedef vector<int>::iterator IT;IT it1,it2,it3;for(it1=--(vs.end());it1!=vs.begin();--it1){it2=find(vs.begin(),it1,*it1);if(it2!=it1){vs.erase(it1);}}for(it3 = vs.begin();it3!=vs.end();++it3){cout << *it3  << " ";}cout << endl;return 0;
}

#include <iostream>
#include <list>
#include <sstream>
#include <algorithm>
using namespace std;
int main()
{string input;unsigned int num1;int num2;cin >> num1;cin.ignore();getline(cin,input);stringstream s(input);list<int> ls;typedef list<int>::iterator IT;while(s>>num2){if(ls.empty()){ls.push_front(num2);}else if(ls.size()>=num1){IT it = find(ls.begin(),ls.end(),num2);if(it!=ls.end()){ls.remove(*it); ls.push_front(num2);}else{ls.pop_back();ls.push_front(num2);}}else{ls.push_front(num2);}}for(IT it=ls.begin();it!=ls.end();++it){cout << *it << " ";}cout << endl;return 0;
}

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <list>
#include <vector>
#include <sstream>
using namespace std;int main()
{list<string>ls1,ls2;//存输入的数据,设置和查找typedef list<string>::iterator ItLs;vector<int>  vs_1,vs_2,vs_3;//存设置的数据范围,vs_3是查找vector<string> vs_s;//存城市位置typedef vector<int>::iterator ItVs_i;typedef vector<string>::iterator ItVs_s;list<vector<int> > ls_f;string input;int num;cin>>num;cin.ignore();for(int i =0;i<num;++i){getline(cin,input);ls1.push_back(input);}for(int i =0;i<num+1;++i){getline(cin,input);ls2.push_back(input);}for(ItLs it=ls1.begin();it!=ls1.end();++it){string s;stringstream ss(*it);ss >> s;char* c1 = new char[strlen(s.c_str())+1];strcpy(c1,s.c_str());char *sst1 = strtok(c1,".");vs_1.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_1.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_1.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_1.push_back(atoi(sst1));ss >> s;char* c2 = new char[strlen(s.c_str())+1];strcpy(c2,s.c_str());char *sst2 = strtok(c2,".");vs_2.push_back(atoi(sst2));sst2 = strtok(NULL,".");vs_2.push_back(atoi(sst2));sst2 = strtok(NULL,".");vs_2.push_back(atoi(sst2));sst2 = strtok(NULL,".");vs_2.push_back(atoi(sst2));ss >> s;vs_s.push_back(s);delete[] c1;delete[] c2;}for(ItLs it=ls2.begin();it!=ls2.end();++it){char* c1 = new char[strlen((*it).c_str())+1];strcpy(c1,(*it).c_str());char *sst1 = strtok(c1,".");vs_3.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_3.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_3.push_back(atoi(sst1));sst1 = strtok(NULL,".");vs_3.push_back(atoi(sst1));delete[] c1;}for(unsigned int a = 0;a<vs_3.size();a+=4){bool info=false;for(unsigned int b=0;b<vs_1.size();b+=4){if(vs_3[a]>=vs_1[b] && vs_3[a]<=vs_2[b]){if(vs_3[a+1]>=vs_1[b+1] && vs_3[a+1]<=vs_2[b+1]){if(vs_3[a+2]>=vs_1[b+2] && vs_3[a+2]<=vs_2[b+2]){if(vs_3[a+3]>=vs_1[b+3] && vs_3[a+3]<=vs_2[b+3]){cout << vs_s[b/4] << endl;info=true;}}}}}if(info==false){cout << "none" << endl;}}return 0;
}

#include <iostream>
#include <list>
#include <sstream>
using namespace std;
int main()
{list<int> ls;typedef list<int>::iterator IT;string input;int num;getline(cin,input);stringstream ss(input);while(ss >> num){ls.push_back(num);ls.sort(greater<int>());ls.unique();}int c = ls.size()<3?ls.size():3;IT it=ls.begin();for(int i =0;i<c;++i){cout << *it <<" ";++it;}cout << endl;return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>struct Point {int x;int y;bool operator < (Point & b){if(x==b.x)return y<b.y?true:false;elsereturn x<b.x;}
};int main() {int x = 0;int y = 0;std::vector<Point> vec;while (std::cin >> x >> y) {Point p;p.x = x;p.y = y;vec.push_back(p);}std::sort(vec.begin(), vec.end());for (auto iter = vec.begin(); iter != vec.end(); ++iter) {std::cout << iter->x << " " << iter->y << std::endl;}return 0;
}

#include <iostream>
#include <map>
#include <string>
void remove_elements(std::map<std::string, int> &m) {typedef  std::map<std::string, int>::iterator IT;for(IT it=m.begin();it!=m.end();++it){if((*it).second == 10){m.erase(it);}}
}int main() {std::map<std::string, int> m;std::string key;int val = 0;while (std::cin >> key >> val) {m[key] = val;}  remove_elements(m);for (const auto &ele : m) {std::cout << ele.first << " " << ele.second << std::endl;}  return 0;
}

牛客网题库公司真题 2021阅文C++方向笔试卷答案相关推荐

牛客网SQL大厂面试真题（二）
SQL25 某宝店铺的SPU数量 SELECT style_id, COUNT(1) AS SPU_num FROM product_tb GROUP BY style_id ORDER BY SPU ...
Java算法：牛客网腾讯笔试真题算法Java版1-11题
题号题目知识点难度通过率 QQ1 生成格雷码递归简单 22.61%QQ2 微信红包模拟简单 25.61%QQ3 编码字符串模拟中等 26.60%QQ4 游戏任务标记模拟中等 3 ...
牛客网 PAT 算法历年真题 1003：数素数 (20)
1003:数素数 (20) 时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自小小) 题目描述令Pi表示第i个素数.现任给两个正整 ...
Java算法：牛客网字节跳动笔试真题算法Java版1-27题
题号题目知识点难度通过率 ZJ1 附加题动态规划数组中等 16.45% ZJ2 编程题1 贪心中等 11.65% ZJ3 编程题2 字符串贪心中等 29.30% ZJ4 附加题递归模 ...
Java算法：牛客网拼多多笔试真题算法Java版1-13题
题号题目知识点难度通过率 PDD1 最大乘积贪心模拟中等 14.45%PDD2 大整数相乘模拟中等 27.32%PDD3 六一儿童节贪心中等 24.74%PDD4 迷宫寻路模拟 ...
牛客网SQL大厂面试真题（一）
SQL1 各个视频的平均完播率 SELECT log.video_id, ROUND(SUM(IF(TIMESTAMPDIFF(SECOND, log.start_time, log.end_time ...
牛客网 SQL大厂面试真题篇 SQL2 平均播放进度大于60%的视频类别
描述用户-视频互动表tb_user_video_log id uid video_id start_time end_time if_follow if_like if_retweet commen ...
牛客网 SQL大厂面试真题篇 SQL5 国庆期间每类视频点赞量和转发量
描述用户-视频互动表tb_user_video_log id uid video_id start_time end_time if_follow if_like if_retweet commen ...
牛客网 SQL大厂面试真题篇 SQL3 每类视频近一个月的转发量/率
描述用户-视频互动表tb_user_video_log id uid video_id start_time end_time if_follow if_like if_retweet commen ...

牛客网题库公司真题 2021阅文C++方向笔试卷答案

牛客网题库公司真题技术(软件)信息技术类 C++工程师 2021阅文C++方向笔试卷

看题：

牛客网题库公司真题 2021阅文C++方向笔试卷答案相关推荐

最新文章

热门文章