contact.h#defineMAX1000#defineMAX_NAME20#defineMAX_SEX5#defineMAX_TELE12#defineMAX_ADDR30#include<stdio.h>#include<string.h>enumOption{EXIT,//0ADD,DEL,SEARCH,MODIFY,SHOW,SORT};structPeoInf
一个数组中只有两个数字是出现一次,其他所有数字都出现了两次。编写一个函数找出这两个只出现一次的数字。LeetCode:只出现一次的数字,题目链接示例输入:[1,2,3,4,5,2,1,3]输出:4,5方法一:先对数组进行排序,排序后进行相邻的数字比较是否相同。图示:#include<stdio.h>voidBbsort(int*a,intn)//冒泡排序{intj=0;inti=0;f
game.h#defineROW9#defineCOL9#defineROWSROW+2#defineCOLSCOL+2#defineEASY_COUNT10//初级中级,高级#include<stdio.h>#include<stdlib.h>#include<time.h>voidCopyBoard(charboard[ROWS][COLS],introws
game.c//所用的库函数和自定义函数的声明#defineCOL3//列#defineROW3//行#include<stdio.h>#include<stdlib.h>#include<time.h>voidCopyBoard(charboard[ROW][COL],introw,intcol);voidLOLBoard(charboard[ROW][COL
二分查找也称折半查找(BinarySearch),它是一种效率较高的查找方法。但是,折半查找要求线性表必须采用顺序存储结构,而且表中元素按关键字有序排列。#include<stdio.h>#include<stdlib.h>intmain(){intarr[]={1,2,3,4,5,6,7,8,9,10};intleft=0;intright=sizeof(arr)/siz
0.0
#include<stdio.h>intmain(){inta,b,y;intc=0;printf("请输入两个数");scanf("%d%d",&a,&b);y=a*b;if(a>b){;}else{a=a+b;b=a-b;a=a-b;}while(a%b){c=a%b;a=b;b=c;}y=y/b;printf("最大公约数%d",b);printf("最小公
#include<stdio.h>intmain(){inta,b,c;c=0;printf("请输入两个数字\n");scanf("%d%d",&a,&b);c=b;b=a;a=c;printf("%d%d",a,b);return0;}//存在中间变量进行两个数交换#include<stdio.h>intmain(){inta,b;printf("请输入
#include<stdio.h>#include<stdlib.h>#include<time.h>voidmenu(){printf("***************************\n");printf("*******1.play*******\n");printf("*******0.exit*******\n");printf("******
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号