循環(huán)數(shù)據(jù)集合的最佳方法是什么。我面臨的問題是性能低下。請參閱示例代碼片段。以下兩種方法存在性能問題。interface Day {    date: number;    disabled: boolean;}// sample dataconst monthDays: Day[] = Array.from({ length: 30 }, (v: unknown, k: number) => ({ date: k + 1, disabled: false }));const disabledDates: number[] = Array.from({ length: 30 }, (v, k) => k + 1);//set disabled dates// method 1let counter = 0;for (let day of monthDays) {    day.disabled = disabledDates.some(d => d === day.date);    counter++;}console.log(counter) // logs 30// method 2counter = 0;for (let day of monthDays) {    for (let date of disabledDates) {        counter++;        if (day.date === date) {            day.disabled = true;            break;        }    }}console.log(counter); // logs 494在我工作的應(yīng)用程序中，我需要對數(shù)組進(jìn)行 3 到 4 次迭代。這會導(dǎo)致應(yīng)用程序性能低下。任何人都可以建議什么是最好的循環(huán)方式。