티스토리 뷰
Problem
You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth 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
Solution
고객의 계좌정보가 이중 배열로 주어질 때 가장 부유한 고객의 자산을 반환하는 문제입니다.
public class Solution {
public int maximumWealth(int[][] accounts) {
int max = -1, sum;
for (int[] account : accounts) {
sum = 0;
for (int wealth : account) {
sum += wealth;
}
max = Math.max(max, sum);
}
return max;
}
}
Test
package io.lcalmsky.leetcode.richest_customer_wealth;
import static org.junit.jupiter.api.Assertions.assertAll;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
class SolutionTest {
@Test
void testAll() {
assertAll(
() -> test(new int[][]{{1, 2, 3}, {3, 2, 1}}, 6),
() -> test(new int[][]{{1, 5}, {7, 3}, {3, 5}}, 10),
() -> test(new int[][]{{2, 8, 7}, {7, 1, 3}, {1, 9, 5}}, 17)
);
}
private void test(int[][] given, int expected) {
// when
Solution solution = new Solution();
int actual = solution.maximumWealth(given);
// then
assertEquals(expected, actual);
}
}
'Algorithm > LeetCode' 카테고리의 다른 글
189. Rotate Array (0) | 2022.02.05 |
---|---|
84. Largest Rectangle in Histogram (0) | 2022.02.04 |
211. Design Add and Search Words Data Structure (0) | 2022.02.01 |
1305. All Elements in Two Binary Search Trees (0) | 2022.01.31 |
1291. Sequential Digits (0) | 2022.01.30 |
댓글
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- 스프링부트
- 알고리즘
- spring boot app
- Linux
- 클린 아키텍처
- gRPC
- Spring Boot
- JPA
- 함께 자라기
- intellij
- proto3
- Spring Boot JPA
- 스프링 부트 회원 가입
- 헥사고날 아키텍처
- @ManyToOne
- spring boot application
- r
- Java
- 스프링 부트 애플리케이션
- 스프링 부트
- spring boot jwt
- leetcode
- Jackson
- 스프링 부트 튜토리얼
- Spring Data JPA
- QueryDSL
- 스프링 데이터 jpa
- 함께 자라기 후기
- JSON
- Spring Boot Tutorial
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 |
글 보관함