摘要: 原题链接在这里:https://leetcode.com/problems/connecting-cities-with-minimum-cost/ 题目: There are N cities numbered from 1 to N. You are given connections, whe 阅读全文
posted @ 2019-08-01 09:41 Dylan_Java_NYC 阅读(3618) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/ 题目: In a social group, there are N people, with unique integer 阅读全文
posted @ 2019-08-01 08:43 Dylan_Java_NYC 阅读(898) 评论(0) 推荐(0) 编辑