Minimum time visiting all points https://leetcode.com/problems/minimum-time-visiting-all-points/

visits.cs

public class Solution {
    public int MinTimeToVisitAllPoints(int[][] points) {
        int seconds = 0;
        int cx = points[0][0];
        int cy = points[0][1];

        for (int i=1; i<points.Length; i++)
        {
            int[] coord = points[i];
            int x = coord[0];
            int y = coord[1];

            while (cx != x || cy != y)
            {
                if (x != cx && y != cy)
                {
                    // Reduce for diagonal move.
                    seconds--;
                }

                if (x < cx)
                {
                    cx--;
                    seconds++;
                }
                else if (x > cx)
                {
                    cx++;
                    seconds++;
                }

                if (y < cy)
                {
                    cy--;
                    seconds++;
                }
                else if (y > cy)
                {
                    cy++;
                    seconds++;
                }
            }
        }

        return seconds;
    }
}