数据结构
飘渺时光
这个作者很懒,什么都没留下…
展开
-
链表的逆置(C版)
#include<stdio.h>#include<stdlib.h>#define OK 1#define ERROR -1#define MAX_SIZE 100typedef int Status;typedef char ElemType;typedef struct LinkList{ ElemType data[MAX_SIZE]; ...原创 2018-10-28 16:15:14 · 410 阅读 · 0 评论 -
数据结构栈的属性
#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define MaxSize 50typedef char ElemType;typedef struct linknode{ ElemType data; struct linknode *next;}LiStack;...原创 2018-10-28 16:18:57 · 420 阅读 · 0 评论 -
数据结构的顺序表
#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define MaxSize 50typedef char ElemType;typedef struct LNode{ ElemType data; struct LNode *next; int Length=0;...原创 2018-10-28 16:20:20 · 96 阅读 · 0 评论 -
链队(LiQueue)
#include<stdio.h>#include<malloc.h>typedef char ElemType;typedef struct qnode{ ElemType data; struct qnode *next;}QNode;typedef struct{ QNode *front; QNode *rear;...原创 2018-10-28 16:27:25 · 567 阅读 · 0 评论 -
环形队列
#include <stdio.h>#include <malloc.h>#define MaxSize 100typedef char ElemType;typedef struct{ ElemType data[MaxSize]; //数据域 int front,rear; //指针域} SqQueue; //链栈类型定义void I...原创 2018-10-28 16:29:13 · 121 阅读 · 0 评论 -
【LeetCod】104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note: A leaf is a node with no childre...原创 2018-12-30 19:45:26 · 107 阅读 · 0 评论 -
【LeetCode】326. Power of Three
Easy228882FavoriteShareGiven an integer, write a function to determine if it is a power of three.Example 1:Input: 27Output: trueExample 2:Input: 0Output: falseExample 3:Input:...原创 2019-02-03 17:49:51 · 270 阅读 · 0 评论