跳到主要内容

std::queue size() 方法

// Const version only
size_type size() const

返回底层容器中元素的数量,即 c.size()

参数

(无)

返回值

容器中的元素数量。

复杂度

常数 - O(1)

示例

Main.cpp
#include <algorithm>
#include <iostream>
#include <queue>

int main()
{
std::queue<int> container;

std::cout << "Initially, container.size(): " << container.size() << '\n';

for (int i = 0; i < 7; ++i)
container.push(i);

std::cout << "After adding elements, container.size(): " << container.size() << '\n';
}
输出
Initially, container.size(): 0
After adding elements, container.size(): 7

std::queue size() 方法

// Const version only
size_type size() const

返回底层容器中元素的数量,即 c.size()

参数

(无)

返回值

容器中的元素数量。

复杂度

常数 - O(1)

示例

Main.cpp
#include <algorithm>
#include <iostream>
#include <queue>

int main()
{
std::queue<int> container;

std::cout << "Initially, container.size(): " << container.size() << '\n';

for (int i = 0; i < 7; ++i)
container.push(i);

std::cout << "After adding elements, container.size(): " << container.size() << '\n';
}
输出
Initially, container.size(): 0
After adding elements, container.size(): 7