首页 > 编程知识 正文

腾讯笔试考什么,腾讯笔试后多久收到面试通知

时间:2023-05-04 06:42:08 阅读:214304 作者:304

2019/9/20
只做了其中的两道题:题目描述:

输入描述:

输出描述:

实例:
#include <iostream>#include <vector>#include <string>using namespace std;int main(){ int t; cin>>t; while(t--){ int n; cin>>n; string s; cin>>s; int l = -1; for(int j=0; j<s.size(); j++) { if(s[j] == '8') { l = j; break; } } if(l == -1) { cout<<"NO"<<endl; continue; } else if(s.size()-l < 11) { cout<<"NO"<<endl; continue; } else { cout<<"YES"<<endl; continue; } } return 0;} 题目4:

题目描述

输入描述:

输出描述:

示例:
/*7 55 8 10 3 6 10 8 */#include <iostream>#include <vector>#include <string>#include <algorithm>using namespace std;//从一个带有空格的输入字符中找出其中的数字vector<int> get_num(string s){ string s1 =s; vector<int> res; while (!s1.empty()) { if (s1.find(" ") == string::npos) { res.push_back(stoi(s1)); s1.clear(); break; } string s_temp = s1.substr(0, s1.find(" ")); res.push_back(stoi(s_temp)); s1.erase(0, s1.find(" ") + 1); } return res;}//找出一个数组当中的非零最小数int min_vt(vector<int> vt){ vector<int> v2; for(int i = 0;i<vt.size();i++) { if(vt[i] > 0) v2.push_back(vt[i]); } int min = *min_element(v2.begin(),v2.end()) ; return min;}//数组减去其中的非零最小数vector<int> sub_min(vector<int> vt){ int min = min_vt(vt) ; for(int i = 0; i<vt.size();i++) { if((vt[i]-min)<0) vt[i] = 0; else vt[i] = vt[i]-min; } return vt;}int main(){ string line1,line2; getline(cin, line1); getline(cin, line2); vector<int> res1,res2; res1 = get_num(line1); res2 = get_num(line2); int min; for(int i = 0; i < res1[1];i++) { min = min_vt(res2); cout<<min<<endl; res2 = sub_min(res2); } return 0;} #include <iostream>#include <string>#include <vector>#include <algorithm>using namespace std;class Resolution{public: int num; int turns; vector<int> numArray; void getData(){ numArray.clear(); cin>>num>>turns; if(num>0){ for(int i=0;i<num;i++){ int temp; cin>>temp; numArray.push_back(temp); } } return; } void printData(){ sort(std::begin(numArray), std::end(numArray)); if(turns<=num){ for(int j=0;j<=turns;){ int minNum = numArray[j]; cout<<minNum; for(int k=j;k<num;k++){ numArray[k] = numArray[k]-minNum; } while(numArray[j] ==0 ){ j++; } } } }};int main(){ Resolution r; r.getData(); r.printData(); return 0;}

版权声明:该文观点仅代表作者本人。处理文章:请发送邮件至 三1五14八八95#扣扣.com 举报,一经查实,本站将立刻删除。