add 1996

fishercoder1534 · fishercoder1534 · commit e2434970cd57 · 2021-09-05T08:53:56.000-07: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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|1996|[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) ||Medium||
 |1995|[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) ||Easy||
 |1992|[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) ||Medium||
 |1991|[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1996.java b/src/main/java/com/fishercoder/solutions/_1996.java
@@ -0,0 +1,22 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1996 {
+    public static class Solution1 {
+        public int numberOfWeakCharacters(int[][] properties) {
+            int count = 0;
+            /**sort them based on:
+             * if attack values equal, then sort by defense value ascendingly
+             * if not, sort by attack values descendingly.
+             * */
+            Arrays.sort(properties, (a, b) -> a[0] == b[0] ? a[1] - b[1] : b[0] - a[0]);
+            int max = 0;
+            for (int i = 0; i < properties.length; i++) {
+                count += max > properties[i][1] ? 1 : 0;
+                max = Math.max(max, properties[i][1]);
+            }
+            return count;
+        }
+    }
+}
