https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work

Author: masx200

README.md

@@ -2612,4 +2612,6 @@ https://leetcode.cn/problems/equal-row-and-column-pairs
 
 https://leetcode.cn/problems/count-vowel-strings-in-ranges
 
+https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work
+
 </details>

leetcode-test.iml

@@ -5,6 +5,7 @@
       <sourceFolder url="file://$MODULE_DIR$/count-vowel-strings-in-ranges" isTestSource="false" packagePrefix="com.github.masx200.leetcode_test.count_vowel_strings_in_ranges" />
       <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" packagePrefix="com.github.masx200.leetcode_test" />
       <sourceFolder url="file://$MODULE_DIR$/zigzag-iterator" isTestSource="false" packagePrefix="com.github.masx200.leetcode_test.zigzag_iterator" />
+      <sourceFolder url="file://$MODULE_DIR$/maximum-number-of-weeks-for-which-you-can-work" isTestSource="false" packagePrefix="com.github.masx200.leetcode_test.maximum_number_of_weeks_for_which_you_can_work" />
       <excludeFolder url="file://$MODULE_DIR$/target" />
     </content>
   </component>

maximum-number-of-weeks-for-which-you-can-work/index.kt

@@ -0,0 +1,15 @@
+package com.github.masx200.leetcode_test.maximum_number_of_weeks_for_which_you_can_work
+
+class Solution {
+    fun numberOfWeeks(milestones: IntArray): Long {
+        var sum: Long = 0
+        var max: Long = 0
+        milestones.forEach {
+            sum += it.toLong()
+            max = Math.max(max, it.toLong())
+        }
+        return if (max * 2 > sum) (sum - max) * 2 + 1 else sum
+
+
+    }
+}