string数组族
strlen -计算数组长度。(改写函数)
#include "stdio.h"
2
3 int main(int argc, const char *argv[])
4 {
5 char str[32]="qqwertyuiop";
6 int count=0;
7 int i=0;
8 while(str[i++]!='\0'){
9 count=i;
10 }
11 printf("count=%d\n",count);
12 return 0;
13 }
strcpy-拷贝字符串(改写函数)
#include "stdio.h"
2
3 int main(int argc, const char *argv[])
4 {
5 char str[32]="qwwertyuiop";
6 char str1[32]="";
7 int i=0;
8 while(str[i]!='\0'){
9 str1[i]=str[i];
10 i++;
11 }
12 str1[i]='\0';
13 printf("%s\n",str1);
14 return 0;
15 }
~
strcmp-比较两个字符串(改写函数)
#include "stdio.h"
int main(int argc, const char *argv[])
{
char str[32]="fwerybvf";
char str1[32]="fwerybvf";
int count=0;
int i=0;
while(str[i]!='\0'){
count=str[i]-str1[i];
if(count==0){
i++;
}
else
break;
}
if(str[i]==str1[i]){
count=0;
}
else
count=str[i]-str1[i];
printf("%d\n",count);
return 0;
}
strcat -字符串拼接(改写函数)
#include "stdio.h"
int main(int argc, const char *argv[])
{
char str[32]="qwwear";
char str1[32]="gfgh";
int i=0;
int j=0;
while(str[i]!='\0'){
i++;
}
while(str1[j]!='\0'){
str[i+j]=str1[j];
j++;
}
str[i+j]='\0';
printf("%s\n",str);
return 0;
}
字符串倒置
#include "stdio.h"
int main(int argc, const char *argv[])
{
char str[32]="a1pbv8";
char c;
int i=0,j=5;
for(i=0,j=5;i<j;i++,j--){
c=str[i];
str[i]=str[j];
str[j]=c;
}
printf("%s\n",str);
return 0;
}
二维数组
二维数组最大值
#include "stdio.h"
int main(int argc, const char *argv[])
{
int arr[3][4]={90,56,41,32,56,98,26,23,12,65,45,78};
int max=arr[0][0];
int x,y;
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
if(max<arr[i][j]){
max=arr[i][j];
x=i;
y=j;
}
}
}
printf("二维数组的最大值是arr[%d][%d]=%d\n",x,y,max);
return 0;
}
杨辉三角
#include "stdio.h"
int main(int argc, const char *argv[])
{
int arr[12][12]={1};
for(int i=1;i<11;i++){
for(int j=1;j<=i;j++){
if(j==i||j==1){
arr[i][j]=1;
printf("%d",arr[i][j]);
}
else{
arr[i][j]=arr[i-1][j-1]+arr[i-1][j];
printf("%d",arr[i][j]);
}
}
printf("\n");
}
return 0;
}