4012. Earliest Time To Finish One Task¶

4012. Earliest Time to Finish One Task

Easy

You are given a 2D integer array tasks where tasks[i] = [si, ti].

Each [si, ti] in tasks represents a task with start time si that takes ti units of time to finish.

Return the earliest time at which at least one task is finished.

Example 1:

Example 2:

Constraints:

• 1 <= tasks.length <= 100
• tasks[i] = [si, ti]
• 1 <= si, ti <= 100

Solution¶

class Solution {
    public int earliestTime(int[][] tasks) {
        int mini = Integer.MAX_VALUE;
        for (int task[] : tasks) 
            mini = Math.min(mini, task[0] + task[1]);
        return mini;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Explanation¶

[Add detailed explanation here]