mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 02:46:30 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
72 lines
1.7 KiB
C++
72 lines
1.7 KiB
C++
/**
|
|
* File: list.cpp
|
|
* Created Time: 2022-11-25
|
|
* Author: Krahets (krahets@163.com)
|
|
*/
|
|
|
|
#include "../utils/common.hpp"
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
/* 初始化列表 */
|
|
vector<int> nums = {1, 3, 2, 5, 4};
|
|
cout << "列表 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 访问元素 */
|
|
int num = nums[1];
|
|
cout << "访问索引 1 处的元素，得到 num = " << num << endl;
|
|
|
|
/* 更新元素 */
|
|
nums[1] = 0;
|
|
cout << "将索引 1 处的元素更新为 0 ，得到 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 清空列表 */
|
|
nums.clear();
|
|
cout << "清空列表后 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 在尾部添加元素 */
|
|
nums.push_back(1);
|
|
nums.push_back(3);
|
|
nums.push_back(2);
|
|
nums.push_back(5);
|
|
nums.push_back(4);
|
|
cout << "添加元素后 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 在中间插入元素 */
|
|
nums.insert(nums.begin() + 3, 6);
|
|
cout << "在索引 3 处插入数字 6 ，得到 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 删除元素 */
|
|
nums.erase(nums.begin() + 3);
|
|
cout << "删除索引 3 处的元素，得到 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 通过索引遍历列表 */
|
|
int count = 0;
|
|
for (int i = 0; i < nums.size(); i++) {
|
|
count += nums[i];
|
|
}
|
|
/* 直接遍历列表元素 */
|
|
count = 0;
|
|
for (int x : nums) {
|
|
count += x;
|
|
}
|
|
|
|
/* 拼接两个列表 */
|
|
vector<int> nums1 = {6, 8, 7, 10, 9};
|
|
nums.insert(nums.end(), nums1.begin(), nums1.end());
|
|
cout << "将列表 nums1 拼接到 nums 之后，得到 nums = ";
|
|
printVector(nums);
|
|
|
|
/* 排序列表 */
|
|
sort(nums.begin(), nums.end());
|
|
cout << "排序列表后 nums = ";
|
|
printVector(nums);
|
|
|
|
return 0;
|
|
}
|