algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0332.重新安排行程.md 更新java版本

Browse Source 
java最后一个方法新增去重逻辑，原代码遇到循环时会无限递归
This commit is contained in:
yawebNW
2024-04-26 11:48:33 +08:00
committed by GitHub
parent 7c5e1c54e2
commit 5955c1de5d
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0332.重新安排行程.md
View File

@ -379,6 +379,8 @@ class Solution {
String targetLocation; String targetLocation;
//遍历从当前位置出发的机票 //遍历从当前位置出发的机票
for (int i = 0; i < targetLocations.size(); i++) { for (int i = 0; i < targetLocations.size(); i++) {
//去重，否则在最后一个测试用例中遇到循环时会无限递归
if(i > 0 && targetLocations.get(i).equals(targetLocations.get(i - 1))) continue;
targetLocation = targetLocations.get(i); targetLocation = targetLocations.get(i);
//删除终点列表中当前的终点 //删除终点列表中当前的终点
targetLocations.remove(i); targetLocations.remove(i);