现在有5个学生,请把5个学生信息通过List方式进行存储、遍历和输出。 样例输入: 样例输出: 00005---小白龙---22 00004---沙悟净---26 00003---唐僧---28 00002---猪八戒---27 00001---孙悟空---25
时间: 2023-08-02 21:07:46 浏览: 44
下面是Python代码实现:
```python
students = [
{"id": "00001", "name": "孙悟空", "age": 25},
{"id": "00002", "name": "猪八戒", "age": 27},
{"id": "00003", "name": "唐僧", "age": 28},
{"id": "00004", "name": "沙悟净", "age": 26},
{"id": "00005", "name": "小白龙", "age": 22}
]
# 遍历输出学生信息
for student in students:
print("{}---{}---{}".format(student["id"], student["name"], student["age"]))
```
输出结果为:
```
00001---孙悟空---25
00002---猪八戒---27
00003---唐僧---28
00004---沙悟净---26
00005---小白龙---22
```
相关问题
用java代码现在有5个学生,请把5个学生信息通过List方式进行存储、遍历和输出。 样例输入: 样例输出: 00005---小白龙---22 00004---沙悟净---26 00003---唐僧---28 00002---猪八戒---27 00001---孙悟空---25
下面是Java代码实现:
```java
import java.util.ArrayList;
import java.util.List;
public class Student {
private String id;
private String name;
private int age;
public Student(String id, String name, int age) {
this.id = id;
this.name = name;
this.age = age;
}
public String getId() {
return id;
}
public void setId(String id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
@Override
public String toString() {
return id + "---" + name + "---" + age;
}
public static void main(String[] args) {
List<Student> students = new ArrayList<>();
students.add(new Student("00001", "孙悟空", 25));
students.add(new Student("00002", "猪八戒", 27));
students.add(new Student("00003", "唐僧", 28));
students.add(new Student("00004", "沙悟净", 26));
students.add(new Student("00005", "小白龙", 22));
for (Student student : students) {
System.out.println(student.toString());
}
}
}
```
输出结果为:
```
00001---孙悟空---25
00002---猪八戒---27
00003---唐僧---28
00004---沙悟净---26
00005---小白龙---22
```
用Java 写 输入描述 顶点个数,边的条数,边的信息(每条边只输入一次)。 输出描述 从V0出发的广度遍历序列和深度遍历序列 样例输入 9 10 0 1 0 3 0 4 1 2 1 4 2 5 3 6 4 6 6 7 7 8 样例输出 ABDECGFHI ABCFEGHID
以下是 Java 实现代码:
```java
import java.util.*;
public class Main {
static int n, m;
static List<Integer>[] graph;
static boolean[] visited;
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
n = input.nextInt();
m = input.nextInt();
graph = new ArrayList[n];
visited = new boolean[n];
for (int i = 0; i < n; i++) {
graph[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = input.nextInt();
int v = input.nextInt();
graph[u].add(v);
graph[v].add(u);
}
for (int i = 0; i < n; i++) {
Collections.sort(graph[i]);
}
dfs(0);
System.out.println();
bfs(0);
}
static void dfs(int u) {
visited[u] = true;
System.out.print((char) ('A' + u));
for (int v : graph[u]) {
if (!visited[v]) {
dfs(v);
}
}
}
static void bfs(int u) {
Queue<Integer> queue = new LinkedList<>();
queue.offer(u);
visited[u] = true;
while (!queue.isEmpty()) {
int cur = queue.poll();
System.out.print((char) ('A' + cur));
for (int v : graph[cur]) {
if (!visited[v]) {
visited[v] = true;
queue.offer(v);
}
}
}
}
}
```
这里使用了邻接表来存储图,DFS 和 BFS 的算法实现与模板相同。