queue::front() and queue::back(): front() 函数返回对队列中第一个元素或最旧元素的引用。 back() 函数返回对队列的最后一个或最新元素的引用。 push(k) and pop(): push() 函数将元素‘k’ 添加到队列末尾。 pop() 函数从队列开头删除元素,并将其大小减少 1。 swap():交换相同类型的两个不同队列...
#include<iostream>#include<sstream>#include<fstream>#include<string>#include#include<vector>#include<list>#include<set>#include<stack>#include<queue>#include<deque>#include<algorithm>#include<functional>#include<iomanip>#include<limits>#include<new>#include<utility>#include<iterator>#include<cstdio>#...
注意输入只有两个数的情况和去除排列时以0为开头的排列。 1#include <cstdio>2#include <fstream>3#include <algorithm>4#include <cmath>5#include <deque>6#include <vector>7#include <queue>8#include <string>9#include <cstring>10#include 11#include <stack>12#include <set>13#include <sstream>14...