Incremental Memory Leak

给一个一直增加的数, 和两个memory, 每次都放到剩余最大的memory里, 求最后的状态

class Solution {
public:
    vector<int> memLeak(int m1, int m2) {
        int n = 1;
        bool run = true;
        while(run){
            run = false;
            if(m1 < m2 && m2 - n >= 0){
                m2 -= n; 
                run = true;
            }else if(m1 >= m2 && m1 - n >= 0){
                m1 -= n; 
                run = true;
            }
            n++;
        }
        vector<int> res{n - 1, m1, m2};
        return res;
    }
};