leetcode图
文章平均质量分 65
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
797. All Paths From Source to Target[Medium](Leetcode每日一题-2021.08.25)
Problem原创 2021-09-01 20:22:23 · 198 阅读 · 0 评论 -
787. Cheapest Flights Within K Stops[Medium](Leetcode每日一题-2021.08.24)
Problem There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei. You are also given three integers src, dst原创 2021-08-24 22:09:45 · 317 阅读 · 0 评论 -
847. Shortest Path Visiting All Nodes[Hard](Leetcode每日一题-2021.08.06)--抄答案
Problem You have an undirected, connected graph of n nodes labeled from 0 to n - 1. You are given an array graph where graph[i] is a list of all the nodes connected with node i by an edge. Return the length of the shortest path that visits every node. You原创 2021-08-06 19:39:43 · 213 阅读 · 0 评论 -
802. Find Eventual Safe States[Medium](Leetcode每日一题-2021.08.05)
Problem We start at some node in a directed graph, and every turn, we walk along a directed edge of the graph. If we reach a terminal node (that is, it has no outgoing directed edges), we stop. We define a starting node to be safe if we must eventually wal原创 2021-08-05 18:55:28 · 115 阅读 · 0 评论 -
743. Network Delay Time[Medium](Leetcode每日一题-2021.08.02)
Problem You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to tra原创 2021-08-02 22:47:09 · 294 阅读 · 0 评论 -
399. Evaluate Division(Leetcode每日一题-2021.01.06)
Problem You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable. You are als原创 2021-01-06 19:11:32 · 231 阅读 · 0 评论 -
127. Word Ladder
Problem Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that: Only one letter can be changed at a time. Each transformed word must exist in the word原创 2020-07-19 21:02:15 · 181 阅读 · 0 评论 -
785. Is Graph Bipartite?(Leetcode每日一题-2020.07.16)
Problem Given an undirected graph, return true if and only if it is bipartite. Recall that a graph is bipartite if we can split it’s set of nodes into two independent subsets A and B such that every edge in the graph has one node in A and another node in B原创 2020-07-16 19:48:23 · 189 阅读 · 0 评论 -
210. Course Schedule II(Leetcode每日一题-2020.05.17)
Problem There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of courses and a l原创 2020-05-17 21:57:03 · 214 阅读 · 0 评论