add 1925

fishercoder1534 · fishercoder1534 · commit cf7aa7b211d4 · 2021-07-10T09:10:43.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        1           
 |-----|----------------|---------------|--------|-------------|-------------
+|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) ||Easy|Array, Greedy|
 |1920|[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) ||Easy||
 |1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) ||Easy|Sort|
 |1910|[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ||Medium|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1925.java b/src/main/java/com/fishercoder/solutions/_1925.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+public class _1925 {
+    public static class Solution1 {
+        public int countTriples(int n) {
+            int count = 0;
+            for (int i = 1; i < n; i++) {
+                for (int j = 1; j < n; j++) {
+                    int product = i * i + j * j;
+                    double sq = Math.sqrt(product);
+                    if (sq <= n && (sq - Math.floor(sq) == 0)) {
+                        count++;
+                    }
+                }
+            }
+            return count;
+        }
+    }
+}
