leetcode 耗时100 1672. Richest Customer Wealth

Problem: 1672. 最富有客户的资产总量就是求最大值Codeclass Solution { public: int maximumWealth(vectorvectorint accounts) { int m accounts.size(), n accounts[0].size(), mx -1; for(int i 0; i m; i) { int sum 0; for(int j 0; j n; j) { sum accounts[i][j]; } if(sum mx) { mx sum; } } return mx; } };