Package g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work

Class Solution

java.lang.Object

g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work.Solution

public class Solution
extends Object

1953 - Maximum Number of Weeks for Which You Can Work.<p>Medium</p> <p>There are <code>n</code> projects numbered from <code>0</code> to <code>n - 1</code>. You are given an integer array <code>milestones</code> where each <code>milestones[i]</code> denotes the number of milestones the <code>i^th</code> project has.</p> <p>You can work on the projects following these two rules:</p> <ul> <li>Every week, you will finish <strong>exactly one</strong> milestone of <strong>one</strong> project. You <strong>must</strong> work every week.</li> <li>You <strong>cannot</strong> work on two milestones from the same project for two <strong>consecutive</strong> weeks.</li> </ul> <p>Once all the milestones of all the projects are finished, or if the only milestones that you can work on will cause you to violate the above rules, you will <strong>stop working</strong>. Note that you may not be able to finish every project&rsquo;s milestones due to these constraints.</p> <p>Return <em>the <strong>maximum</strong> number of weeks you would be able to work on the projects without violating the rules mentioned above</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> milestones = [1,2,3]</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> One possible scenario is:</p> <ul> <li> <p>During the 1^st week, you will work on a milestone of project 0.</p> </li> <li> <p>During the 2^nd week, you will work on a milestone of project 2.</p> </li> <li> <p>During the 3^rd week, you will work on a milestone of project 1.</p> </li> <li> <p>During the 4^th week, you will work on a milestone of project 2.</p> </li> <li> <p>During the 5^th week, you will work on a milestone of project 1.</p> </li> <li> <p>During the 6^th week, you will work on a milestone of project 2.</p> </li> </ul> <p>The total number of weeks is 6.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> milestones = [5,2,1]</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong> One possible scenario is:</p> <ul> <li> <p>During the 1^st week, you will work on a milestone of project 0.</p> </li> <li> <p>During the 2^nd week, you will work on a milestone of project 1.</p> </li> <li> <p>During the 3^rd week, you will work on a milestone of project 0.</p> </li> <li> <p>During the 4^th week, you will work on a milestone of project 1.</p> </li> <li> <p>During the 5^th week, you will work on a milestone of project 0.</p> </li> <li> <p>During the 6^th week, you will work on a milestone of project 2.</p> </li> <li> <p>During the 7^th week, you will work on a milestone of project 0.</p> </li> </ul> <p>The total number of weeks is 7. Note that you cannot work on the last milestone of project 0 on 8^th week because it would violate the rules. Thus, one milestone in project 0 will remain unfinished.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == milestones.length</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>1 <= milestones[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
long	numberOfWeeks(int[] milestones)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

numberOfWeeks

public long numberOfWeeks(int[] milestones)