1672. Richest Customer Wealth

---

Description

You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.

A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth.

 

Example 1:

Input: accounts = [[1,2,3],[3,2,1]]
Output: 6
Explanation:
1st customer has wealth = 1 + 2 + 3 = 6
2nd customer has wealth = 3 + 2 + 1 = 6
Both customers are considered the richest with a wealth of 6 each, so return 6.

Example 2:

Input: accounts = [[1,5],[7,3],[3,5]]
Output: 10
Explanation: 
1st customer has wealth = 6
2nd customer has wealth = 10 
3rd customer has wealth = 8
The 2nd customer is the richest with a wealth of 10.

Example 3:

Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
Output: 17

 

Constraints:

    m == accounts.length
    n == accounts[i].length
    1 <= m, n <= 50
    1 <= accounts[i][j] <= 100

---

Code

// 1672. Richest Customer Wealth
func rechestCustomerWealth(accounts [][]int) int {
	max := 0

	for _, account := range accounts {
		sum := 0
		for _, money := range account {
			sum += money
		}

		if sum > max {
			max = sum
		}
	}

	return max
}

 

주어진 함수는 두 개의 반복문을 사용합니다. 외부 반복문은 모든 고객을 순회하고, 내부 반복문은 각 고객의 재산을 순회합니다. 내부 반복문은 고객이 가진 계좌의 수에 비례하므로, 이 코드의 시간 복잡도는 고객 수를 나타내는 n에 비례합니다. 따라서 주어진 함수의 시간 복잡도는 O(n)입니다.