Greatest Sum Divisible by Three
Given an integer array nums, return 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
18Pick numbers 3, 6, 1, and 8; their sum is 18, which is the maximum sum divisible by 3.
Example 2
Input
nums = [4]Output
0Since 4 is not divisible by 3, do not pick any number.
Constraints
- 1 <= nums.length <= 4 * 10^4
- 1 <= nums[i] <= 10^4