LEEDCODE 1672最富有客户的资产总量

class Solution {
public:
    int maximumWealth(vector<vector<int>>& accounts) {
        int m = accounts.size();
        int n = accounts[0].size();
        int max = -100;
        int tmp = 0;

        for(int i = 0; i < m; i++)
        {
            tmp = 0;
            for(int j = 0; j < n; j++)
            {
                tmp += accounts[i][j];
            }
            if(tmp > max)
            {
                max = tmp;
            }
        }
        return max;
    }
};