【leetcode】可被三整除的最大和

class Solution {
public:
    int maxSumDivThree(vector<int> &nums) {
        int remains[3] = {0};
        int zero, one, two;
        for (int num: nums) {
            zero = remains[0] + num;
            one = remains[1] + num;
            two = remains[2] + num;
            remains[zero % 3] = max(remains[zero % 3], zero);
            remains[one % 3] = max(remains[one % 3], one);
            remains[two % 3] = max(remains[two % 3], two);
        }
        return remains[0];
    }
};