LeetCode/MaximumWealth.java at main · Dylan-Burns/LeetCode · GitHub

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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
//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

public class MaximumWealth {
    public int maximumWealth(int[][] accounts) {
        int max = 0;
        int[] sum = new int[accounts.length];
        for(int i = 0; i < accounts.length; i++){
            for(int j = 0; j < accounts[i].length; j++){
                sum[i] += accounts[i][j];
                System.out.println("j = " + j + " accounts[" + i + "][" + j + "] = " + accounts[i][j]);
            }

            System.out.println("i = " + i + " Sum = " + sum[i]);
            System.out.println("///////////////////////////////");

            if(sum[i] > max){
                 max = sum[i];
            }
        }

        return max;
    }

//    public int maximumWealth(int[][] accounts) {
//        int max = 0;
//        int[] sum = new int[accounts.length];
//        for(int i = 0; i < accounts.length; i++){
//            for(int j = 0; j < accounts.length; j++){
//                sum[i] += accounts[i][j];
//            }
//            if(sum[i] > max){
//                max = sum[i];
//            }
//        }
//        return max;
//    }

    public static void main(String[] args) {
        MaximumWealth max = new MaximumWealth();
//        int[][] accounts = {{1, 5}, {7, 3}, {3, 5}};
        int[][] accounts = {{1, 2, 3}, {3, 2, 1}};
//        int[][] accounts = {{1, 5}, {7, 3}, {3, 5}};
        System.out.println(accounts.length);
        System.out.println(max.maximumWealth(accounts));;

    }
}