MCPcopy Create free account
hub / github.com/StudyRust/leetcode_rust / main

Function main

1266-minimum-time-visiting-all-points.rs:12–19  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

10// 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
11
12fn main() {
13 let points = vec!(
14 vec!(1,1),
15 vec!(3,4),
16 vec!(-1,0)
17 );
18 println!("{:?}", min_time_to_visit_all_points(points));
19}
20
21// 归纳总结题目。经过归纳总结发现,发现2点间取x距离或y距离的较大那个就是时间。
22pub fn min_time_to_visit_all_points(points: Vec<Vec<i32>>) -> i32 {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected