add 1672

fishercoder1534 · fishercoder1534 · commit c64edc76fcc6 · 2020-11-29T07:00:33.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1672|[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) ||Easy|Array|
 |1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) ||Medium|LinedList|
 |1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) ||Easy|String|
 |1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)|[Javascript](./javascript/_1664.js) ||Medium|Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1672.java b/src/main/java/com/fishercoder/solutions/_1672.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+public class _1672 {
+    public static class Solution1 {
+        public int maximumWealth(int[][] accounts) {
+            int m = accounts.length;
+            int n = accounts[0].length;
+            int max = 0;
+            for (int i = 0; i < m; i++) {
+                int sum = 0;
+                for (int j = 0; j < n; j++) {
+                    sum += accounts[i][j];
+                }
+                max = Math.max(max, sum);
+            }
+            return max;
+        }
+    }
+}
