摘要：1150 Travelling Salesman Problem (25分) The "travelling salesman problem" asks the following question: "Given a list of cities and the distances betwee 阅读全文

摘要：1154 Vertex Coloring (25分) A proper vertex coloring is a labeling of the graph's vertices with colors such that no two vertices sharing the same edge 阅读全文

摘要：https://leetcode cn.com/problems/minimum cost to make at least one valid path in a grid/ 该题可以抽象为从左上角到右上角需要的最小花费， 求最小花费就是求最小路径 其中边权可以抽象为 0 1， 当一个点存在方向时 阅读全文