被遗忘的，眼镜

题解

/ 注册

全部文章 / 题解（共31篇）

题解 | #计算字符串的距离#

再优化一点儿，最后所需空间为O(N) #include <stdio.h> #include <string.h> int min(int a ,int b) { return ((a)>(b)?(b):(a)); } int get_diff2(char*...

C

2021-11-24

0 391

题解 | #计算字符串的距离#

优化了一下空间 #include <string.h> int min(int a ,int b) { return ((a)>(b)?(b):(a)); } int get_diff2(char* s1, char* s2) { int len1 = strl...

C

2021-11-24

0 537

题解 | #二叉搜索树与双向链表#

typedef struct TreeNode Node; Node* Convert_core(Node* pHead) { Node* pNode = pHead; Node* left=NULL; Node* right=NULL; Node* ret; ...

C

2021-11-15

0 312

题解 | #二叉搜索树的后序遍历序列#

递归 #include<stdbool.h> bool Check_core(int *a, int Len) { int index; int i; bool flag = false; if (a == NULL || Len <= 1) ...

C

2021-11-15

0 303

题解 | #从上往下打印二叉树#

C语言的一种实现 typedef struct TreeNode Node; #define Ele Node* typedef struct Queue { Ele val; struct Queue* next; }Queue; typedef struct Queue_head { ...

C

2021-11-14

0 289

题解 | #栈的压入、弹出序列#

C 的粗暴实现 #include<stdbool.h> typedef struct Stack { int val; struct Stack* next; }Stack; int IsEmpty(Stack* S) { if (!S || !(S->next)) ...

C

2021-11-14

1 329

题解 | #包含min函数的栈#

比较笨的C模拟 #define Ele int #define MAX 100000 struct Stack { Ele Top; struct Stack* Next; }; typedef struct Stack Stack; static Stack *Sta; sta...

C

2021-11-14

1 328

题解 | #顺时针打印矩阵#

void print_core(int** matrix,int *a, int R,int C,int begin_r,int begin_c) { int r,c; if((2*begin_r)>R-1||(2*begin_c)>C-1)//矩阵中没有元素了...

C

2021-11-14

2 334

题解 | #对称的二叉树#

#include <stdbool.h> typedef struct TreeNode Node; int Check(Node* left, Node* right) { if (left == NULL && right != NULL) return 0;...

C

2021-11-14

0 391

题解 | #二叉树的镜像#

typedef struct TreeNode Node; struct TreeNode* Mirror(struct TreeNode* pRoot ) { Node* tmp = pRoot; Node* tmp1; if (!tmp) return NULL; tmp...

C

2021-11-14

0 236