0143919

最新推荐文章于 2022-02-25 23:45:16 发布

dandan12581

最新推荐文章于 2022-02-25 23:45:16 发布

阅读量177

点赞数

CC 4.0 BY-SA版权

分类专栏：作业文章标签：作业 c namespace iostream string

本文链接：https://blog.youkuaiyun.com/dandan12581/article/details/44706229

作业专栏收录该内容

2 篇文章

订阅专栏

#include<iostream>

using namespace std;

intmax(int a=1,int b=1)

{

return(a>b? a:b);

}

intmax(int a=1,int b=1,int c)

{int d=max(a,b); return(c>d? c:d);

}

void main()

{cout<<max(2)<<endl; cout<<max(3,4)<<endl;

cout<<max(2,3,4)<<endl;

}

#include<iostream>
using namespace std;
void swap(int &x,int &y)
{
int temp=x;
x=y;
y=temp;
}
int main()
{
int a,b;
cin>>a>>b;
if(a>b)
swap(a,b);
cout<<a<<b;
return 0;
}

#include <iostream>
using namespace std;
void res(int &x,int &y,int&z)
{ int temp;
if(x>y)
{ temp=y;y=x;x=temp;};
if(x>z)
{temp=z;z=x;x=temp;};
if(y>z)
{temp=y;y=z;z=temp;};

}
void main()
{ int a,b,c;
cout<<"输入三个数字"<<endl;
cin>>a>>b>>c;
res(a,b,c);
cout<<a<<""<<b<<" "<<c;
}

10.

#include<iostream>

#include<string>

#include<cstring>

using namespace std;

int main()

{

string string1,string2;

cin>>string1>>string2;

char *dest=new char[string1.length()+string2.length()+1];

memset(dest,0,string1.length()+string2.length());

strncpy(dest,string1.c_str(),string1.length());

strncat(dest,string2.c_str(),string2.length());

string1=dest;

cout<<"string1="<<string1<<endl;

delete dest;

return 0;

}

11. #include <iostream>
#include <string>
using namespace std;
int main()
{
int i;
string str;
cout<<"请输入一串字符："<<endl;
cin>>str;
cout<<"字符串倒序后为："<<endl;
for(i=str.length()-1;i>=0;i--)
cout<<str[i];
cout<<endl;

system("pause");
return 0;
}

12.

#include<iostream>
#include<string>
const int N=20;
const int n=5;
using namespace std;
void swap(char x,char y)
{
char p;
p=x;
x=y;
y=p;
}
void main()
{
char *a[n];
int i,j;
for(i=0;i<n;i++)
{
a[i]=new char[N];

cin>>a[i];
}
int minlen;
http://blog.youkuaiyun.com/for(i=0;i<n;i++)
{
minlen=i;
for(j=i+1;j<n;j++)
if(strlen(a[j])<strlen(a[minlen]))
minlen=j;
swap(a[i],a[minlen]);
}
for(i=0;i<n;i++)
cout<<a[i]<<endl;
for(i=0;i<n;i++)
delete a[i];
}

13.