<style> .reveal .slides { text-align: left; font-size:32px; } </style> ## 530競技程式培力基地(五) ---- - stack - queue --- ## stack 堆疊 ---- stack 就像是堆盤子一樣，往上疊 也是從最上面取盤子 LIFO (Last In First Out) ---- ```cpp= stack<type> st; stack<int>st; st.push(12);// 12 st.push(13);// 12 13 st.push(14);// 12 13 14 int n=st.size();// n = 3 int tp=st.top();// tp = 14 st.pop();// 12 13 ``` --- ## queue 佇列 ---- queue 像是排隊的概念，從後面進入 從前面取出 FIFO (First In First Out) ---- ```cpp= queue<type>q; queue<int>q; q.push(1);// 1 q.push(2);// 1 2 q.push(3);// 1 2 3 int n=q.size();// n = 3 int u=q.front();// u = 1 q.pop();// 2 3 ``` --- [題目連結](https://vjudge.net/contest/762166)