add 1995

fishercoder1534 · fishercoder1534 · commit 483e69de31a3 · 2021-09-05T08:45:07.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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|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||
 |1985|[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1995.java b/src/main/java/com/fishercoder/solutions/_1995.java
@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+public class _1995 {
+    public static class Solution1 {
+        public int countQuadruplets(int[] nums) {
+            int count = 0;
+            for (int i = 0; i < nums.length - 3; i++) {
+                for (int j = i + 1; j < nums.length - 2; j++) {
+                    for (int k = j + 1; k < nums.length - 1; k++) {
+                        for (int l = k + 1; l < nums.length; l++) {
+                            if (nums[i] + nums[j] + nums[k] == nums[l]) {
+                                count++;
+                            }
+                        }
+                    }
+                }
+            }
+            return count;
+        }
+    }
+}
