algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加内容

Browse Source
This commit is contained in:
YDZ
2020-08-08 09:17:26 +08:00
parent 5015cc6b7b
commit fdba30f0c4
734 changed files with 4024 additions and 2129 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/0815.Bus-Routes/README.md
View File

@ -1,7 +1,7 @@
# [815. Bus Routes](https://leetcode.com/problems/bus-routes/)
## 题目:
## 题目
We have a list of bus routes. Each `routes[i]` is a bus route that the i-th bus repeats forever. For example if `routes[0] = [1, 5, 7]`, this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.