From d7fcd66676e25a5837ac5252196af39a7f84854f Mon Sep 17 00:00:00 2001 From: Jarrian Date: Sat, 4 Nov 2023 08:14:35 +0800 Subject: [PATCH] feat: add java solution to problem 1503 --- .../README.md | 51 +++++++++++++++++++ .../Solution.java | 13 +++++ 2 files changed, 64 insertions(+) create mode 100644 Medium/1503. Last Moment Before All Ants Fall Out of a Plank/README.md create mode 100644 Medium/1503. Last Moment Before All Ants Fall Out of a Plank/Solution.java diff --git a/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/README.md b/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/README.md new file mode 100644 index 0000000..1f22bc9 --- /dev/null +++ b/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/README.md @@ -0,0 +1,51 @@ +# Problem 1503 ([Last Moment Before All Ants Fall Out of a Plank](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/) | Array, Brainteaser, Simulation) + +![MEDIUM](https://img.shields.io/badge/-MEDIUM-ffa116?style=for-the-badge&logo=LeetCode&logoColor=white) + +
+

We have a wooden plank of the length n units. Some ants are walking on the plank, each ant moves with a speed of 1 unit per second. Some of the ants move to the left, the other move to the right.

+ +

When two ants moving in two different directions meet at some point, they change their directions and continue moving again. Assume changing directions does not take any additional time.

+ +

When an ant reaches one end of the plank at a time t, it falls out of the plank immediately.

+ +

Given an integer n and two integer arrays left and right, the positions of the ants moving to the left and the right, return the moment when the last ant(s) fall out of the plank.

+ +

Example 1:

+ +
Input: n = 4, left = [4,3], right = [0,1]
+Output: 4
+Explanation: In the image above:
+-The ant at index 0 is named A and going to the right.
+-The ant at index 1 is named B and going to the right.
+-The ant at index 3 is named C and going to the left.
+-The ant at index 4 is named D and going to the left.
+The last moment when an ant was on the plank is t = 4 seconds. After that, it falls immediately out of the plank. (i.e., We can say that at t = 4.0000000001, there are no ants on the plank).
+
+ +

Example 2:

+ +
Input: n = 7, left = [], right = [0,1,2,3,4,5,6,7]
+Output: 7
+Explanation: All ants are going to the right, the ant at index 0 needs 7 seconds to fall.
+
+ +

Example 3:

+ +
Input: n = 7, left = [0,1,2,3,4,5,6,7], right = []
+Output: 7
+Explanation: All ants are going to the left, the ant at index 7 needs 7 seconds to fall.
+
+ +

Constraints:

+ + +
diff --git a/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/Solution.java b/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/Solution.java new file mode 100644 index 0000000..fb6392e --- /dev/null +++ b/Medium/1503. Last Moment Before All Ants Fall Out of a Plank/Solution.java @@ -0,0 +1,13 @@ +class Solution { + public int getLastMoment(int n, int[] left, int[] right) { + Arrays.sort(left); + Arrays.sort(right); + int t1 = 0; + int t2 = 0; + if (left.length > 0) + t1 = left[left.length - 1]; + if (right.length > 0) + t2 = n - right[0]; + return Math.max(t1, t2); + } +} \ No newline at end of file