C++输入

C++输入

1.单元素输入整数（处理程序在while内书写）

#include <iostream>using namespace std;
int main()
{
int a, b;
while(cin >> a >> b)
{
cout << a + b << endl;
}
return 0;
}

2.单元素输入字符（处理程序在while内书写）

int main()
{
char ch;
while(cin>>ch){
cout<<ch;
}
return 0
}

3.单元素输入字符串（处理程序在while内书写）

int main()
{
string ch;
while(cin>>ch){
cout<<ch;
}
return 0
}

4.输入n个整数元素到vector

int main(){
int n,num;
cin>>n;
vector<int>ans;
while(n--&&cin>>num){
ans.push_back(num);
}
return 0;
}

5.输入n个字符的字符串

int main(){
int n；
char ch;
cin>>n;
string str;
while(n--&&cin>>ch){
str+=ch;
}
return 0;
}

6.输入m行n列的二维数组

int main(){
int n,m,num;
cin>>m>>n;
vector<vector<int> >ans(m,vector<int>(n,0));
for(int i=0;i<m;i++){
int j=0;
while(j<n&&cin>>num){
ans[i][j]=num;
j++;
}
}
return 0;
}

7.输入带特定符号隔开的字符到vector中（空格自动识别）

int main() {
    string temp1;
    int c;
    string a,b;
    vector<int>w,v;
    int index1=0,index2=0;
    while(cin>>c>>a>>b){
       for(int i=0;i<a.size();i++){
           if(a[i]=='特定字符'||i==a.size()-1){
               if(i==a.size()-1){
                   temp1=a.substr(index1,i-index1+1);
                   w.push_back(stoi(temp1));
               }
               else{
                   temp1=a.substr(index1,i-index1);
                   w.push_back(stoi(temp1));
               }
               index1=i+1;
           }
       }
       for(int i=0;i<b.size();i++){
            if(b[i]=='特定字符'||i==b.size()-1){
                if(i==b.size()-1){
                    temp1=b.substr(index2,i-index2+1);
                    v.push_back(stoi(temp1));
                }
                else{
                    temp1=b.substr(index2,i-index2);
                    v.push_back(stoi(temp1));
                }
                index2=i+1;
            }
        }
      return 0;
}

8.输入一个数a，之后再输入a个数，依此类推

#include<iostream>
#include<set>
using namespace std;
int main()
{
    int N,n;
    set<int> ss;
    while(cin>>N)     //多组数据
    {
        ss.clear();   //清除上一组数据的影响
     while(N--)
     {
         cin>>n;
         ss.insert(n);
     }
     for (set<int>::iterator it = ss.begin(); it != ss.end(); it++)
     {
            cout << *it << endl;
     }     
    }
    return 0;
}

9.创建一个单链表

#include<iostream>
#include<vector>
#include<string>

using namespace std;

struct ListNode{//链表结构
    int val;
    ListNode* next;
};

void createlistnode(vector<int>&ans,ListNode* head){
    ListNode* p=head;
    for(int i=0;i<ans.size();i++){
        int temp=ans[i];
        ListNode* phead=new ListNode;
        phead->val=temp;
        phead->next=nullptr;
        p->next=phead;
        p=p->next;
    }
}

int main(){
	int num;
	vector<int>ans;
	while (cin >> num){
		ans.push_back(num);//输入数据
	}
   ListNode* head=new ListNode;//表头
   head->val=0;
   head->next=nullptr;
   createlistnode(ans,head); //创建链表
   while(head!=nullptr){    //显示链表
       cout<<head->val<<endl;
       head=head->next;
   }
	return 0;
}

10.创建一颗树

#include<iostream>
#include<vector>
#include<string>
#include<queue>

using namespace std;

struct TreeNode{
    int val;
    TreeNode *left,*right;
    TreeNode(){
        left=nullptr;
        right=nullptr;
    }
};

TreeNode* build(TreeNode* root,int val){
    if(!root){
        root=new TreeNode();
        root->val=val;
        return root;
    }
    if(val<root->val)
       root->left=build(root->left,val);
    else if(val>root->val)
       root->right=build(root->right,val);
    return root;
}
void levelOrder(TreeNode* root){
     queue<TreeNode*> q;
      q.push(root);
      while(!q.empty()){
         TreeNode *temp = q.front();
         q.pop();
         cout<<temp->val<<" ";
        if(temp->left) q.push(temp->left);
         if(temp->right) q.push(temp->right);
     }
 }
int main(){
     TreeNode *root = NULL;
     int t[] = {5,4,6,3,7};
     for(int i = 0; i < 5; i++) root = build(root, t[i]);
     levelOrder(root);
 return 0;
}