ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update stack and queue.

Browse Source
This commit is contained in:
Yudong Jin
2022-11-30 02:27:26 +08:00
parent 53cc651af2
commit 8669e06414
24 changed files with 705 additions and 186 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/cpp/chapter_array_and_linkedlist/my_list.cpp
View File

@@ -34,14 +34,14 @@ public:
int get(int index) {
// 索引如果越界则抛出异常，下同
if (index >= size())
throw std::out_of_range ("索引越界");
throw out_of_range("索引越界");
return nums[index];
}
/* 更新元素 */
void set(int index, int num) {
if (index >= size())
throw std::out_of_range ("索引越界");
throw out_of_range("索引越界");
nums[index] = num;
}
@@ -58,7 +58,7 @@ public:
/* 中间插入元素 */
void insert(int index, int num) {
if (index >= size())
throw std::out_of_range ("索引越界");
throw out_of_range("索引越界");
// 元素数量超出容量时，触发扩容机制
if (size() == capacity())
extendCapacity();
@@ -74,7 +74,7 @@ public:
/* 删除元素 */
void remove(int index) {
if (index >= size())
throw std::out_of_range ("索引越界");
throw out_of_range("索引越界");
// 索引 i 之后的元素都向前移动一位
for (int j = index; j < size() - 1; j++) {
nums[j] = nums[j + 1];

116
codes/cpp/chapter_stack_and_queue/array_queue.cpp
View File

@@ -6,3 +6,119 @@
#include "../include/include.hpp"
/* 基于环形数组实现的队列 */
class ArrayQueue {
private:
vector<int> nums; // 用于存储队列元素的数组
int front = 0; // 头指针，指向队首
int rear = 0; // 尾指针，指向队尾 + 1
public:
ArrayQueue(int capacity) {
// 初始化数组
nums.resize(capacity);
}
/* 获取队列的容量 */
int capacity() {
return nums.size();
}
/* 获取队列的长度 */
int size() {
int cap = capacity();
// 由于将数组看作为环形，可能 rear < front ，因此需要取余数
return (cap + rear - front) % cap;
}
/* 判断队列是否为空 */
bool empty() {
return rear - front == 0;
}
/* 入队 */
void offer(int num) {
if (size() == capacity()) {
cout << "队列已满" << endl;
return;
}
// 尾结点后添加 num
nums[rear] = num;
// 尾指针向后移动一位，越过尾部后返回到数组头部
rear = (rear + 1) % capacity();
}
/* 出队 */
int poll() {
// 删除头结点
if (empty())
throw out_of_range("队列为空");
int num = nums[front];
// 队头指针向后移动，越过尾部后返回到数组头部
front = (front + 1) % capacity();
return num;
}
/* 访问队首元素 */
int peek() {
// 删除头结点
if (empty())
throw out_of_range("队列为空");
return nums[front];
}
vector<int> toVector() {
int siz = size();
int cap = capacity();
// 仅转换有效长度范围内的列表元素
vector<int> arr(siz);
for (int i = 0, j = front; i < siz; i++, j++) {
arr[i] = nums[j % cap];
}
return arr;
}
};
/* Driver Code */
int main() {
/* 初始化队列 */
int capacity = 10;
ArrayQueue* queue = new ArrayQueue(capacity);
/* 元素入队 */
queue->offer(1);
queue->offer(3);
queue->offer(2);
queue->offer(5);
queue->offer(4);
cout << "队列 queue = ";
PrintUtil::printVector(queue->toVector());
/* 访问队首元素 */
int peek = queue->peek();
cout << "队首元素 peek = " << peek << endl;
/* 元素出队 */
int poll = queue->poll();
cout << "出队元素 poll = " << poll << "，出队后 queue = ";
PrintUtil::printVector(queue->toVector());
/* 获取队列的长度 */
int size = queue->size();
cout << "队列长度 size = " << size << endl;
/* 判断队列是否为空 */
bool empty = queue->empty();
cout << "队列是否为空 = " << empty << endl;
/* 测试环形数组 */
for (int i = 0; i < 10; i++) {
queue->offer(i);
queue->poll();
cout << "第 " << i << " 轮入队 + 出队后 queue = ";
PrintUtil::printVector(queue->toVector());
}
return 0;
}

28
codes/cpp/chapter_stack_and_queue/array_stack.cpp
View File

@@ -9,38 +9,44 @@
/* 基于数组实现的栈 */
class ArrayStack {
private:
vector<int> vec;
vector<int> stack;
public:
/* 获取栈的长度 */
int size() {
return vec.size();
return stack.size();
}
/* 判断栈是否为空 */
bool empty() {
return vec.empty();
return stack.empty();
}
/* 入栈 */
void push(int num) {
vec.push_back(num);
stack.push_back(num);
}
/* 出栈 */
int pop() {
int oldTop = vec.back();
vec.pop_back();
int oldTop = stack.back();
stack.pop_back();
return oldTop;
}
/* 访问栈顶元素 */
int top() {
return vec.back();
return stack.back();
}
/* 访问索引 index 处元素 */
int get(int index) {
return stack[index];
}
/* 返回 Vector */
vector<int> toVector() {
return vec;
return stack;
}
};
@@ -57,8 +63,7 @@ int main() {
stack->push(5);
stack->push(4);
cout << "栈 stack = ";
vector<int> vec = stack->toVector();
PrintUtil::printVector(vec);
PrintUtil::printVector(stack->toVector());
/* 访问栈顶元素 */
int top = stack->top();
@@ -67,8 +72,7 @@ int main() {
/* 元素出栈 */
int pop = stack->pop();
cout << "出栈元素 pop = " << pop << "，出栈后 stack = ";
vec = stack->toVector();
PrintUtil::printVector(vec);
PrintUtil::printVector(stack->toVector());
/* 获取栈的长度 */
int size = stack->size();

39
codes/cpp/chapter_stack_and_queue/deque.cpp
View File

@@ -6,3 +6,42 @@
#include "../include/include.hpp"
/* Driver Code */
int main() {
/* 初始化双向队列 */
deque<int> deque;
/* 元素入队 */
deque.push_back(2);
deque.push_back(5);
deque.push_back(4);
deque.push_front(3);
deque.push_front(1);
cout << "双向队列 deque = ";
PrintUtil::printDeque(deque);
/* 访问队首元素 */
int front = deque.front();
cout << "队首元素 front = " << front << endl;
int back = deque.back();
cout << "队尾元素 back = " << back << endl;
/* 元素出队 */
deque.pop_front();
cout << "队首出队元素 popFront = " << front << "，队首出队后 deque = ";
PrintUtil::printDeque(deque);
deque.pop_back();
cout << "队尾出队元素 popLast = " << back << "，队尾出队后 deque = ";
PrintUtil::printDeque(deque);
/* 获取双向队列的长度 */
int size = deque.size();
cout << "双向队列长度 size = " << size << endl;
/* 判断双向队列是否为空 */
bool empty = deque.empty();
cout << "双向队列是否为空 = " << empty << endl;
return 0;
}

94
codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp
View File

@@ -6,3 +6,97 @@
#include "../include/include.hpp"
/* 基于链表实现的队列 */
class LinkedListQueue {
private:
ListNode *front, *back;
int qSize;
public:
LinkedListQueue() {
front = nullptr;
back = nullptr;
qSize = 0;
}
/* 获取队列的长度 */
int size() {
return qSize;
}
/* 判断队列是否为空 */
bool empty() {
return qSize == 0;
}
/* 入队 */
void offer(int num) {
// 尾结点后添加 num
ListNode* node = new ListNode(num);
node->next = back;
back = node;
qSize++;
}
/* 出队 */
int poll() {
if (qSize == 0)
throw out_of_range("队列为空");
// 删除头结点
ListNode* node = front;
front = front->next;
return node->val;
}
/* 访问队首元素 */
int peek() {
return front->val;
}
/* 将 List 转化为 Array 并返回 */
vector<int> toVector() {
ListNode* node = front;
vector<int> vec;
while (node != nullptr) {
vec.push_back(node->val);
node = node->next;
}
reverse(vec.begin(), vec.end());
return vec;
}
};
/* Driver Code */
int main() {
/* 初始化队列 */
LinkedListQueue* queue = new LinkedListQueue();
/* 元素入队 */
queue->offer(1);
queue->offer(3);
queue->offer(2);
queue->offer(5);
queue->offer(4);
cout << "队列 queue = ";
PrintUtil::printVector(queue->toVector());
/* 访问队首元素 */
int peek = queue->peek();
cout << "队首元素 peek = " << peek << endl;
/* 元素出队 */
int poll = queue->poll();
cout << "出队元素 poll = " << poll << "，出队后 queue = ";
PrintUtil::printVector(queue->toVector());
/* 获取队列的长度 */
int size = queue->size();
cout << "队列长度 size = " << size << endl;
/* 判断队列是否为空 */
bool empty = queue->empty();
cout << "队列是否为空 = " << empty << endl;
return 0;
}

53
codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp
View File

@@ -9,38 +9,59 @@
/* 基于链表实现的栈 */
class LinkedListStack {
private:
list<int> list;
ListNode* stackTop; // 将头结点作为栈顶
int stackSize; // 栈的长度
public:
LinkedListStack() {
stackTop = nullptr;
stackSize = 0;
}
/* 获取栈的长度 */
int size() {
return list.size();
return stackSize;
}
/* 判断栈是否为空 */
bool empty() {
return list.empty();
return size() == 0;
}
/* 入栈 */
void push(int num) {
list.push_back(num);
ListNode* node = new ListNode(num);
node->next = stackTop;
stackTop = node;
stackSize++;
}
/* 出栈 */
int pop() {
int oldTop = list.back();
list.pop_back();
return oldTop;
if (size() == 0)
throw out_of_range("栈为空");
int num = stackTop->val;
stackTop = stackTop->next;
stackSize--;
return num;
}
/* 访问栈顶元素 */
int top() {
return list.back();
if (size() == 0)
throw out_of_range("栈为空");
return stackTop->val;
}
/* 将 List 转化为 Array 并返回 */
vector<int> toVector() {
vector<int> vec;
for (int num : list) {
vec.push_back(num);
ListNode* node = stackTop;
vector<int> res(size());
for (int i = res.size() - 1; i >= 0; i--) {
res[i] = node->val;
node = node->next;
}
return vec;
return res;
}
};
@@ -57,8 +78,7 @@ int main() {
stack->push(5);
stack->push(4);
cout << "栈 stack = ";
vector<int> vec = stack->toVector();
PrintUtil::printVector(vec);
PrintUtil::printVector(stack->toVector());
/* 访问栈顶元素 */
int top = stack->top();
@@ -67,8 +87,7 @@ int main() {
/* 元素出栈 */
int pop = stack->pop();
cout << "出栈元素 pop = " << pop << "，出栈后 stack = ";
vec = stack->toVector();
PrintUtil::printVector(vec);
PrintUtil::printVector(stack->toVector());
/* 获取栈的长度 */
int size = stack->size();
@@ -77,4 +96,6 @@ int main() {
/* 判断是否为空 */
bool empty = stack->empty();
cout << "栈是否为空 = " << empty << endl;
return 0;
}

3
codes/cpp/chapter_stack_and_queue/queue.cpp
View File

@@ -35,7 +35,8 @@ int main(){
cout << "队列长度 size = " << size << endl;
/* 判断队列是否为空 */
bool isEmpty = queue.empty();
bool empty = queue.empty();
cout << "队列是否为空 = " << empty << endl;
return 0;
}

1
codes/cpp/chapter_stack_and_queue/stack.cpp
View File

@@ -36,6 +36,7 @@ int main() {
/* 判断是否为空 */
bool empty = stack.empty();
cout << "栈是否为空 = " << empty << endl;
return 0;
}

22
codes/cpp/include/PrintUtil.hpp
View File

@@ -102,7 +102,7 @@ class PrintUtil {
* @param list
*/
template <typename T>
static void printVector(vector<T> &list) {
static void printVector(vector<T> list) {
cout << getVectorString(list) << '\n';
}
@@ -218,7 +218,7 @@ class PrintUtil {
* @param stk
*/
template <typename T>
static void printStack(stack<T> &stk) {
static void printStack(stack<T> stk) {
// Reverse the input stack
stack<T> tmp;
while(!stk.empty()) {
@@ -246,7 +246,7 @@ class PrintUtil {
* @param queue
*/
template <typename T>
static void printQueue(queue<T> &queue)
static void printQueue(queue<T> queue)
{
// Generate the string to print
ostringstream s;
@@ -261,4 +261,20 @@ class PrintUtil {
}
cout << "[" + s.str() + "]" << '\n';
}
template <typename T>
static void printDeque(deque<T> deque) {
// Generate the string to print
ostringstream s;
bool flag = true;
while(!deque.empty()) {
if (flag) {
s << deque.front();
flag = false;
}
else s << ", " << deque.front();
deque.pop_front();
}
cout << "[" + s.str() + "]" << '\n';
}
};