更新贪心求解失败的显示问题

main
zart 8 months ago
parent 50a7f7fb1c
commit e4123c7a43

@ -514,7 +514,7 @@ class CustomPath:
num = len(user_paths)
for i in range(num): # 逐个节点进行匹配
if not user_paths[i] == min_path[i]:
return False, f"正确的贪心节点顺序为{min_path}\n你的第{i+1}个节点{min_path[i]}不符合贪心规则。" # 返回不匹配的节点
return False, f"正确的贪心节点顺序为{min_path}\n当前路径不符合贪心规则。" # 返回不匹配的节点
return True , None # 返回True表示是贪心路径
def Path_to_nodes(self, Path, start_node=0):

Loading…
Cancel
Save