遍历线性表的代码实现
时间: 2024-08-13 18:00:36 浏览: 34
遍历线性表(如数组、链表等)通常有几种常见的方法:
1. **数组遍历**:
- C/C++示例:
```cpp
for (int i = 0; i < array_size; i++) {
cout << arr[i] << " ";
}
```
- Python示例:
```python
for element in array:
print(element)
```
2. **单向链表遍历**:
- C++示例(使用迭代):
```cpp
Node* current = head;
while (current != nullptr) {
cout << current->data << " ";
current = current->next;
}
```
- Python示例(使用迭代):
```python
current_node = head
while current_node is not None:
print(current_node.data)
current_node = current_node.next
```
3. **双向链表遍历**:
- C++示例(使用迭代):
```cpp
Node* current = head;
while (current != nullptr) {
cout << current->data << " ";
current = current->next;
}
while (current->prev != nullptr) {
cout << current->prev->data << " ";
current = current->prev;
}
```
- Python示例(同样道理):
遍历的过程就是依次访问每个元素,直到列表结束。