本文介绍在 angular 项目中通过哈希查找(map/对象)方式,以 o(n) 时间复杂度将学生数组与教师数组按 `teacherid` 关联,动态注入教师姓名,生成结构化合并结果。
在 Angular 应用中,常需将两个独立的数据源(如 students 和 teachers)基于外键(如 teacherId)进行一对一关联,而非使用数据库 JOIN。直接嵌套循环(forEach + find)虽可行,但时间复杂度为 O(n×m),在数据量增大时性能明显下降。推荐采用空间换时间策略:先构建教师 ID 到姓名的快速查找表
,再批量映射。
// 在组件或服务中定义数据(示例)
students = [
{ name: 'shariful', id: '1', teacherId: '1' },
{ name: 'Hasan', id: '2', teacherId: '2' },
{ name: 'sohag', id: '3', teacherId: '2' }
];
teachers = [
{ name: 'Robi', id: '1' },
{ name: 'Aktarujaman', id: '2' }
];
// 步骤 1:构建教师查找表(Object 或 Map 均可)
private buildTeacherLookup(): Record {
return Object.fromEntries(
this.teachers.map(teacher => [teacher.id, teacher.name])
);
}
// 步骤 2:映射学生数组,注入 teacherName
getStudentsWithTeacherNames(): any[] {
const lookup = this.buildTeacherLookup();
return this.students.map(student => ({
...student,
teacherName: lookup[student.teacherId] ?? null // 安全处理缺失 ID
}));
} 调用后即可获得目标结构:
[
{ name: 'shariful', id: '1', teacherId: '1', teacherName: 'Robi' },
{ name: 'Hasan', id: '2', teacherId: '2', teacherName: 'Aktarujaman' },
{ name: 'sohag', id: '3', teacherId: '2', teacherName: 'Aktarujaman' }
]interface Student { name: string; id: string; teacherId: string; teacherName?: string; }
interface Teacher { name: string; id: string; }const teacherMap = new Map(this.teachers.map(t => [t.id, t.name]));
const res = students.map(s => ({ ...s, teacherName: teacherMap.get(s.teacherId) || null }));该方法简洁、高效、易测试,是 Angular 数据处理中的最佳实践之一。