1266. Minimum Time Visiting All Points

Author: remy727

README.md

@@ -327,6 +327,7 @@
 | 1220 | Count Vowels Permutation | [Ruby](./algorithms/ruby/1220-count-vowels-permutation.rb) | Hard |
 | 1232 | Check If It Is a Straight Line | [Ruby](./algorithms/ruby/1232-check-if-it-is-a-straight-line.rb) | Easy |
 | 1254 | Number of Closed Islands | [Ruby](./algorithms/ruby/1254-number-of-closed-islands.rb) | Medium |
+| 1266 | Minimum Time Visiting All Points | [Ruby](./algorithms/ruby/1266-minimum-time-visiting-all-points.rb) | Easy |
 | 1268 | Search Suggestions System | [Ruby](./algorithms/ruby/1268-search-suggestions-system.rb) | Medium |
 | 1269 | Number of Ways to Stay in the Same Place After Some Steps | [Ruby](./algorithms/ruby/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.rb) | Hard |
 | 1282 | Group the People Given the Group Size They Belong To | [Ruby](./algorithms/ruby/1282-group-the-people-given-the-group-size-they-belong-to.rb) | Medium |

algorithms/ruby/1160-find-words-that-can-be-formed-by-characters.rb

@@ -64,7 +64,7 @@ def count_characters(words, chars)
 require "test/unit"
 class Test_count_characters < Test::Unit::TestCase
   def test_
-    assert_equal 6, count_characters(["cat","bt","hat","tree"], "atach")
-    assert_equal 10, count_characters(["hello","world","leetcode"], "welldonehoneyr")
+    assert_equal 6, count_characters(["cat", "bt", "hat", "tree"], "atach")
+    assert_equal 10, count_characters(["hello", "world", "leetcode"], "welldonehoneyr")
   end
 end

algorithms/ruby/1266-minimum-time-visiting-all-points.rb

@@ -0,0 +1,56 @@
+# frozen_string_literal: true
+
+# 1266. Minimum Time Visiting All Points
+# Easy
+# https://leetcode.com/problems/minimum-time-visiting-all-points/
+
+=begin
+On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the order given by points.
+You can move according to these rules:
+* In 1 second, you can either:
+  * move vertically by one unit,
+  * move horizontally by one unit, or
+  * move diagonally sqrt(2) units (in other words, move one unit vertically then one unit horizontally in 1 second).
+* You have to visit the points in the same order as they appear in the array.
+* You are allowed to pass through points that appear later in the order, but these do not count as visits.
+
+Example 1:
+Input: points = [[1,1],[3,4],[-1,0]]
+Output: 7
+Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]
+Time from [1,1] to [3,4] = 3 seconds
+Time from [3,4] to [-1,0] = 4 seconds
+Total time = 7 seconds
+
+Example 2:
+Input: points = [[3,2],[-2,2]]
+Output: 5
+
+Constraints:
+points.length == n
+1 <= n <= 100
+points[i].length == 2
+-1000 <= points[i][0], points[i][1] <= 1000
+=end
+
+# @param {Integer[][]} points
+# @return {Integer}
+def min_time_to_visit_all_points(points)
+  result = 0
+  (0...points.length - 1).each do |i|
+    result += [(points[i][0] - points[i + 1][0]).abs, (points[i][1] - points[i + 1][1]).abs].max
+  end
+  result
+end
+
+# **************** #
+#       TEST       #
+# **************** #
+
+require "test/unit"
+class Test_min_time_to_visit_all_points < Test::Unit::TestCase
+  def test_
+    assert_equal 7, min_time_to_visit_all_points([[1, 1], [3, 4], [-1, 0]])
+    assert_equal 5, min_time_to_visit_all_points([[3, 2], [-2, 2]])
+  end
+end