feat: add java solution to lc problem No:2249 (doocs#803)

No.2249.Count Lattice Points Inside a Circle

Author: chriy

solution/2200-2299/2249.Count Lattice Points Inside a Circle/README.md

@@ -73,7 +73,23 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int countLatticePoints(int[][] circles) {
+        int ans = 0;
+        for (int i = 0; i <= 200; i++) {
+            for (int j = 0; j <= 200; j++) {
+                for (int[] circle : circles) {
+                    int x = circle[0], y = circle[1], r = circle[2];
+                    if ((i - x) * (i - x) + (j - y) * (j - y) <= r * r) {
+                        ans++;
+                        break;
+                    }
+                }
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2249.Count Lattice Points Inside a Circle/README_EN.md

@@ -59,7 +59,23 @@ Some of them are (0, 2), (2, 0), (2, 4), (3, 2), and (4, 4).
 ### **Java**
 
 ```java
-
+class Solution {
+    public int countLatticePoints(int[][] circles) {
+        int ans = 0;
+        for (int i = 0; i <= 200; i++) {
+            for (int j = 0; j <= 200; j++) {
+                for (int[] circle : circles) {
+                    int x = circle[0], y = circle[1], r = circle[2];
+                    if ((i - x) * (i - x) + (j - y) * (j - y) <= r * r) {
+                        ans++;
+                        break;
+                    }
+                }
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2249.Count Lattice Points Inside a Circle/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int countLatticePoints(int[][] circles) {
+        int ans = 0;
+        for (int i = 0; i <= 200; i++) {
+            for (int j = 0; j <= 200; j++) {
+                for (int[] circle : circles) {
+                    int x = circle[0], y = circle[1], r = circle[2];
+                    if ((i - x) * (i - x) + (j - y) * (j - y) <= r * r) {
+                        ans++;
+                        break;
+                    }
+                }
+            }
+        }
+        return ans;
+    }
+}