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.<p>Medium</p> <p>Given an array <code>nums</code> of integers, we need to find the maximum possible sum of elements of the array such that it is divisible by three.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [3,6,5,1,8]</p> <p><strong>Output:</strong> 18</p> <p><strong>Explanation:</strong> Pick numbers 3, 6, 1 and 8 their sum is 18 (maximum sum divisible by 3).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> Since 4 is not divisible by 3, do not pick any number.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4,4]</p> <p><strong>Output:</strong> 12</p> <p><strong>Explanation:</strong> Pick numbers 1, 3, 4 and 4 their sum is 12 (maximum sum divisible by 3).</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 4 * 10^4</code></li> <li><code>1 <= nums[i] <= 10^4</code></li> </ul>

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)