leetcode
qx LIU 2000
这个作者很懒,什么都没留下…
展开
-
leetcode 225. 用队列实现栈【数据结构初阶】
typedef int QDatatype; typedef struct QueueNode { QDatatype data; struct QueueNode * next; }QueueNode; typedef struct Queue { QueueNode* head; QueueNode* tail; }Queue; void QueueInit(Queue * pq); void QueueDestory(Queue* pq); void QueuePush(Queue*原创 2021-04-22 16:28:37 · 140 阅读 · 0 评论 -
leetcode 232.用栈实现队列
typedef struct { int* stk; int stkSize; int stkCapacity; } Stack; Stack* stackCreate(int cpacity) { Stack* ret = malloc(sizeof(Stack)); ret->stk = malloc(sizeof(int) * cpacity); ret->stkSize = 0; ret->stkCapacity = cpa原创 2021-04-22 16:26:00 · 68 阅读 · 0 评论 -
leetcode 622 .设计循环队列
typedef struct { int *a; int k ; int front; int tail; } MyCircularQueue; MyCircularQueue* myCircularQueueCreate(int k) { MyCircularQueue* obj = (MyCircularQueue*)malloc(sizeof(MyCircularQueue)); obj->a = (int *)malloc(sizeof(i原创 2021-04-22 16:24:33 · 86 阅读 · 0 评论 -
leetcode 138.复制带随机指针的链表
拷贝节点链接在原节点后面 /** * Definition for a Node. * struct Node { * int val; * struct Node *next; * struct Node *random; * }; */ struct Node* copyRandomList(struct Node* head) { struct Node* cur = head; while(cur) { struc...原创 2021-04-13 15:20:24 · 92 阅读 · 0 评论 -
leetcode 141.环形链表(一和二)
代码: /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ bool hasCycle(struct ListNode *head) { struct ListNode* slow = head,*fast = head; while(fast && fast -> next) ...原创 2021-04-13 14:37:48 · 83 阅读 · 0 评论