Algo lab/stack queue codes - ประวัติรุ่นแก้ไข

Jittat เมื่อ 02:44, 17 กันยายน 2563

2020-09-17T02:44:52Z

Jittat: /* Queue */

2020-09-17T02:39:15Z

Queue

Jittat: /* Queue */

2020-09-17T02:33:29Z

Queue

Jittat: สร้างหน้าด้วย "== Queue == typedef int ValueT; struct ListNode { ValueT val; ListNode* next; ListNode(ValueT val, ListNode* next=..."

2020-09-17T02:32:36Z

สร้างหน้าด้วย "== Queue == <syntaxhighlight lang="c++"> typedef int ValueT; struct ListNode { ValueT val; ListNode* next; ListNode(ValueT val, ListNode* next=..."

หน้าใหม่

== Queue ==

<syntaxhighlight lang="c++">

typedef int ValueT;

struct ListNode {
ValueT val;
ListNode* next;

ListNode(ValueT val, ListNode* next=0)
: val(val), next(next) {}
};

ListNode* front;
ListNode* rear;

void init_queue()
{
front = rear = 0;
}

void insert_queue(ValueT v)
{
ListNode* new_node = new ListNode(v);

if(rear != 0) {
rear->next = new_node;
rear = new_node;
} else {
front = rear = new_node;
}
}

ValueT extract_queue()
{
if(front != 0) {
ValueT v = front->val;

ListNode* new_front = front->next;
delete front;
front = new_front;

if(front == 0) {
rear = 0;
}

return v;
} else {
throw "Error extract from empty queue";
}
}

bool is_empty()
{
return front == 0;
}

</syntaxhighlight>

@@ แถว 52: / แถว 52: @@
+}
-bool is_empty()
+bool is_queue_empty()
+{
    return (front == 0);

@@ แถว 1: / แถว 1: @@
-== Queue ==
+== Queues ==
 <syntaxhighlight lang="c++">
@@ แถว 57: / แถว 57: @@
+}
 </syntaxhighlight>