queue< int > a;
a.push(x) (後ろに追加)
a.pop() (前を削除)
X = a.front() (前を習得)
a.size()
a.empty()
More than 1 year has passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme