在抱佛脚的海豚很想吃烤肉

分类

/ 注册

全部文章（共41篇）

题解 | #进制转换2#

#include <stdio.h> #include<math.h> // 计算字符串长度: int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { ...

2023-02-23

0 268

题解 | #进制转换#

#include <stdio.h> #include<stdbool.h> #define MAXSIZE 500 typedef int ElemType ; typedef struct { ElemType data[MAXSIZE]; int top...

2023-02-23

0 283

题解 | #二进制数#

#include <stdio.h>#include<stdbool.h>#define MAXSIZE 30typedef int ElemType;typedef struct { ElemType data[MAXSIZE]; int top;} Stack...

2023-02-23

0 345

题解 | #堆栈的使用#

#include <stdio.h>#include <stdbool.h>#define MaxSize 1000typedef struct test { int data[MaxSize]; int top;} Stack;void InitStack(St...

2023-02-23

0 244

题解 | #计算表达式#

#include <stdio.h> #include <stdbool.h> // 计算字符串长度： int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { ...

2023-02-20

0 336

题解 | #complexityTransposition#

#include <stdio.h> #include <stdbool.h> #define MAXSIZE 1000 typedef int ElemType; typedef struct { ElemType data[MAXSIZE]; int to...

2023-02-19

0 207

题解 | #浮点数加法#

#include <stdio.h> // 计算字符串长度： int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { n++; } return n; }...

2023-02-12

0 247

题解 | #首字母大写#

#include <stdio.h> int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { n++; } return n; } int main() ...

2023-02-12

0 165

题解 | #单词替换#

#include <stdio.h> //求字符串长度： int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { n++; } return n; } i...

2023-02-11

0 226

题解 | #skew数#

#include <stdio.h> #include<math.h> // 计算字符串长度： int Length(char a[]) { int n = 0; for (int i = 0; a[i] != '\0'; i++) { n++...

2023-02-11

0 204