78] 1672. Richest Customer Wealth Kotlin

https://leetcode.com/problems/richest-customer-wealth/description/

Richest Customer Wealth - LeetCode

 

2차원 int 배열이 주어질때 

각 행의 합 중 최대값을 리턴하는 문제.

class Solution {
    fun maximumWealth(accounts: Array<IntArray>): Int {

        var ans = 0
        for(i in 0 until accounts.size) {
            var cnt = 0
            for(j in 0 until accounts[i].size) {
                cnt += accounts[i][j]
            }

            if(ans < cnt)
              ans = cnt
        }

        return ans
    }
}