爱因斯坦_铎

分类

题解(4)

/ 注册

全部文章（共3篇）

题解 | #分苹果#

include <math.h> void findA(int *a, int temp, int index, int average, int n){ int i; if(temp == (-2)){ for(i = index+1; i< n ;){ ...

2021-08-29

0 494

题解 | #计算某字母出现次数#

int main(){ int i = 0; int count = 0; int gap= 'A'-'a'; char seq; char a; seq = (char)malloc(500*sizeof(char)); while((seq[i] = g...

2021-08-27

0 387

题解 | #字符串最后一个单词的长度#

include <stdio.h> include <stdlib.h> int main(){ int i=0; int idx, num=0; char seq; seq = (char)malloc(5000*sizeof(char)); ...

2021-08-27

0 430