1503. Last Moment Before All Ants Fall Out of a Plank LeetCode Solution
In this guide, you will get 1503. Last Moment Before All Ants Fall Out of a Plank LeetCode Solution with the best time and space complexity. The solution to Last Moment Before All Ants Fall Out of a Plank problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Last Moment Before All Ants Fall Out of a Plank
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.
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:
1 <= n <= 104
0 <= left.length <= n + 1
0 <= left[i] <= n
0 <= right.length <= n + 1
0 <= right[i] <= n
1 <= left.length + right.length <= n + 1
All values of left and right are unique, and each value can appear only in one of the two arrays.
Complexity Analysis
Time Complexity: O(n)
Space Complexity: O(1)
1503. Last Moment Before All Ants Fall Out of a Plank LeetCode Solution in C++
class Solution {
public:
int getLastMoment(int n, vector<int>& left, vector<int>& right) {
const int maxLeft = left.empty() ? 0 : ranges::max(left);
const int minRight = right.empty() ? n : ranges::min(right);
return max(maxLeft, n - minRight);
}
}; /* code provided by PROGIEZ */
1503. Last Moment Before All Ants Fall Out of a Plank LeetCode Solution in Java
N/A // code provided by PROGIEZ
1503. Last Moment Before All Ants Fall Out of a Plank LeetCode Solution in Python
