思维导图:
1.
代码:
#include<stdio.h>
int main(int argc, const char *argv[])
{
int i = 0;
int sum = 0;
int j=0;
char a[64]="0";
gets(a);
while(a[i]==' ')
{
i++;
}
if(a[i]=='+'||a[i]=='-')
{
j = i;
i++;
}
while(a[i]!='\0')
{
if(a[i]>='0'&&a[i]<='9')
{
a[i]=a[i]-'0';
sum = sum*10+a[i];
}
else
break;
i++;
}
if(a[j]=='-')
{sum = -sum;}
printf("%d\n",sum);
return 0;
}
运行结果:
2.
代码:
include<stdio.h>
#include<string.h>
int main(int argc, const char *argv[])
{
int i = 0;
char a[64] = "0";
char b[64] = "0";
char c[64] = "0";
gets(a);
gets(b);
gets(c);
i = strcmp(a,b);
if(i>0)
{
i = strcmp(a,c);
if(i>0)
{
puts(a);
}
else
puts(c);
}
else
{
i = strcmp(b,c);
if(i>0)
{
puts(b);
}
else
puts(c);
}
return 0;
}
运行结果:
3.
代码:
#include<stdio.h>
#include<string.h>
int main(int argc, const char *argv[])
{
char a[64];
char b[64];
char c[64]="0";
gets(a);
gets(b);
strcpy(c,b);
strcpy(b,a);
strcpy(a,c);
puts(a);
puts(b);
return 0;
}
运行结果:
4.
代码:
#include<stdio.h>
#include<string.h>
int main(int argc, const char *argv[])
{
char a[64];
char b[64];
gets(a);
gets(b);
int i = 0;
unsigned long int num = 0;
for(i=0; a[i]!='\0' ;i++)
{
num++;
}
for(i=0; b[i]!='\0';i++)
{
a[num] = b[i];
num++;
}
puts(a);
return 0;
}
运行结果:
5.
代码:
#include<stdio.h>
#include<string.h>
int main(int argc, const char *argv[])
{
/*
char a[64];
char b[64];
char c[64]="0";
gets(a);
gets(b);
strcpy(c,b);
strcpy(b,a);
strcpy(a,c);
puts(a);
puts(b);
*/
/*
char a[64];
char b[64];
gets(a);
gets(b);
int i = 0;
unsigned long int num = 0;
for(i=0; a[i]!='\0' ;i++)
{
num++;
}
for(i=0; b[i]!='\0';i++)
{
a[num] = b[i];
num++;
}
puts(a);
*/
char a[64];
char b[64];
gets(a);
gets(b);
int i = 0;
for(i=0; b[i]!='\0' ;i++)
{
a[i]=b[i];
}
a[i]=b[i];
puts(a);
return 0;
}
运行结果:
6.
代码:
#include<stdio.h>
int main(int argc, const char *argv[])
{
char a[64]="0";
gets(a);
int i = 0;
int j = 0;
int k = 0;
for(i=0;a[i]!='\0';i++)
{
j++;
}
j--;
for(i=0;i<j;i++)
{
k = a[i];
a[i] = a[j];
a[j] = k;
j--;
}
puts(a);
return 0;
}
运行结果:
7.
代码:
#include<stdio.h>
int main(int argc, const char *argv[])
{
char a[64];
int i = 0;
int j = 0;
int k = 0;
int m = 0;
gets(a);
for(i=0;a[i+1]!='\0';i++)
{
for(j=i+1,k=i; a[j]!='\0'; j++)
{
if(a[i] > a[j])
{
if(a[k]>a[j])
k = j;
}
}
if( k != i )
{
m = a[i];
a[i] = a[k];
a[k] = m;
}
}
puts(a);
return 0;
}
运行结果: