Package g1201_1300.s1262_greatest_sum_divisible_by_three

Class Solution

java.lang.Object

g1201_1300.s1262_greatest_sum_divisible_by_three.Solution

public class Solution
extends Object

1262 - Greatest Sum Divisible by Three\. Medium Given an array `nums` of integers, we need to find the maximum possible sum of elements of the array such that it is divisible by three. **Example 1:** **Input:** nums = [3,6,5,1,8] **Output:** 18 **Explanation:** Pick numbers 3, 6, 1 and 8 their sum is 18 (maximum sum divisible by 3). **Example 2:** **Input:** nums = [4] **Output:** 0 **Explanation:** Since 4 is not divisible by 3, do not pick any number. **Example 3:** **Input:** nums = [1,2,3,4,4] **Output:** 12 **Explanation:** Pick numbers 1, 3, 4 and 4 their sum is 12 (maximum sum divisible by 3). **Constraints:** * `1 <= nums.length <= 4 * 10^4` * `1 <= nums[i] <= 10^4`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxSumDivThree(int[] nums)

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

maxSumDivThree

public int maxSumDivThree(int[] nums)