fix: java code

Author: yanglbme

solution/3500-3599/3531.Count Covered Buildings/README.md

@@ -150,7 +150,6 @@ class Solution:
 #### Java
 
 ```java
-
 class Solution {
     public int countCoveredBuildings(int n, int[][] buildings) {
         Map<Integer, List<Integer>> g1 = new HashMap<>();
@@ -176,7 +175,8 @@ class Solution {
             List<Integer> l1 = g1.get(x);
             List<Integer> l2 = g2.get(y);
 
-            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y && y < l1.get(l1.size() - 1)) {
+            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y
+                && y < l1.get(l1.size() - 1)) {
                 ans++;
             }
         }

solution/3500-3599/3531.Count Covered Buildings/README_EN.md

@@ -148,7 +148,6 @@ class Solution:
 #### Java
 
 ```java
-
 class Solution {
     public int countCoveredBuildings(int n, int[][] buildings) {
         Map<Integer, List<Integer>> g1 = new HashMap<>();
@@ -174,7 +173,8 @@ class Solution {
             List<Integer> l1 = g1.get(x);
             List<Integer> l2 = g2.get(y);
 
-            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y && y < l1.get(l1.size() - 1)) {
+            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y
+                && y < l1.get(l1.size() - 1)) {
                 ans++;
             }
         }

solution/3500-3599/3531.Count Covered Buildings/Solution.java

@@ -1,9 +1,8 @@
-
 class Solution {
     public int countCoveredBuildings(int n, int[][] buildings) {
         Map<Integer, List<Integer>> g1 = new HashMap<>();
         Map<Integer, List<Integer>> g2 = new HashMap<>();
-        
+
         for (int[] building : buildings) {
             int x = building[0], y = building[1];
             g1.computeIfAbsent(x, k -> new ArrayList<>()).add(y);
@@ -24,7 +23,8 @@ public int countCoveredBuildings(int n, int[][] buildings) {
             List<Integer> l1 = g1.get(x);
             List<Integer> l2 = g2.get(y);
 
-            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y && y < l1.get(l1.size() - 1)) {
+            if (l2.get(0) < x && x < l2.get(l2.size() - 1) && l1.get(0) < y
+                && y < l1.get(l1.size() - 1)) {
                 ans++;
             }
         }