摘要：
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), w 阅读全文
posted @ 2020-10-18 12:52
CNoodle
阅读(239)
评论(0)
推荐(0)
摘要：
Given a string s, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them causing the left and the right side 阅读全文
posted @ 2020-10-18 04:36
CNoodle
阅读(330)
评论(0)
推荐(0)
摘要：
Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make 阅读全文
posted @ 2020-10-18 04:24
CNoodle
阅读(192)
评论(0)
推荐(0)
浙公网安备 33010602011771号