classSolution{publicintminTimeToVisitAllPoints(int[][] points){int ans =0;for(int i =0; i < points.length -1; i++){int a = Math.abs(points[i +1][0]- points[i][0]);int b = Math.abs(points[i +1][1]- points[i][1]);
ans += a + b - Math.min(a, b);}return ans;}}
本地测试代码
package com.company;publicclassSolution_1266{publicstaticintminTimeToVisitAllPoints(int[][] points){int ans =0;for(int i =0; i < points.length -1; i++){int a = Math.abs(points[i +1][0]- points[i][0]);int b = Math.abs(points[i +1][1]- points[i][1]);
ans += a + b - Math.min(a, b);}return ans;}publicstaticvoidmain(String[] args){
System.out.println(minTimeToVisitAllPoints(newint[][]{{1,1},{3,4},{-1,0}}));
System.out.println(minTimeToVisitAllPoints(newint[][]{{3,2},{-2,2}}));}}