mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 01:06:28 +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
62 lines
1.4 KiB
Dart
62 lines
1.4 KiB
Dart
/**
|
|
* File: list.dart
|
|
* Created Time: 2023-01-24
|
|
* Author: Jefferson (JeffersonHuang77@gmail.com)
|
|
*/
|
|
|
|
// ignore_for_file: unused_local_variable
|
|
|
|
/* Driver Code */
|
|
void main() {
|
|
/* 初始化列表 */
|
|
List<int> nums = [1, 3, 2, 5, 4];
|
|
print('列表 nums = $nums');
|
|
|
|
/* 访问元素 */
|
|
int _num = nums[1];
|
|
print('访问索引 1 处的元素，得到 _num = $_num');
|
|
|
|
/* 更新元素 */
|
|
nums[1] = 0;
|
|
print('将索引 1 处的元素更新为 0 ，得到 nums = $nums');
|
|
|
|
/* 清空列表 */
|
|
nums.clear();
|
|
print('清空列表后 nums = $nums');
|
|
|
|
/* 在尾部添加元素 */
|
|
nums.add(1);
|
|
nums.add(3);
|
|
nums.add(2);
|
|
nums.add(5);
|
|
nums.add(4);
|
|
print('添加元素后 nums = $nums');
|
|
|
|
/* 在中间插入元素 */
|
|
nums.insert(3, 6);
|
|
print('在索引 3 处插入数字 6 ，得到 nums = $nums');
|
|
|
|
/* 删除元素 */
|
|
nums.removeAt(3);
|
|
print('删除索引 3 处的元素，得到 nums = $nums');
|
|
|
|
/* 通过索引遍历列表 */
|
|
int count = 0;
|
|
for (var i = 0; i < nums.length; i++) {
|
|
count += nums[i];
|
|
}
|
|
/* 直接遍历列表元素 */
|
|
count = 0;
|
|
for (var x in nums) {
|
|
count += x;
|
|
}
|
|
|
|
/* 拼接两个列表 */
|
|
List<int> nums1 = [6, 8, 7, 10, 9];
|
|
nums.addAll(nums1);
|
|
print('将列表 nums1 拼接到 nums 之后，得到 nums = $nums');
|
|
|
|
/* 排序列表 */
|
|
nums.sort();
|
|
print('排序列表后 nums = $nums');
|
|
}
|