Format code in README_EN.md file

Author: yanglbme

solution/3300-3399/3377.Digit Operations to Make Two Integers Equal/README_EN.md

@@ -180,7 +180,7 @@ class Solution {
 
     private int solve(int n, int m) {
         PriorityQueue<int[]> pq = new PriorityQueue<>(Comparator.comparingInt(a -> a[0]));
-        pq.add(new int[]{n, n});
+        pq.add(new int[] {n, n});
         Set<Integer> visited = new HashSet<>();
 
         while (!pq.isEmpty()) {
@@ -204,7 +204,7 @@ class Solution {
                     s[i] = (char) (s[i] + 1);
                     int next = Integer.parseInt(new String(s));
                     if (!sieve[next] && !visited.contains(next)) {
-                        pq.add(new int[]{sum + next, next});
+                        pq.add(new int[] {sum + next, next});
                     }
                     s[i] = c;
                 }
@@ -213,7 +213,7 @@ class Solution {
                     s[i] = (char) (s[i] - 1);
                     int next = Integer.parseInt(new String(s));
                     if (!sieve[next] && !visited.contains(next)) {
-                        pq.add(new int[]{sum + next, next});
+                        pq.add(new int[] {sum + next, next});
                     }
                     s[i] = c;
                 }
@@ -283,6 +283,7 @@ private:
         }
         return -1;
     }
+
 public:
     int minOperations(int n, int m) {
         runSieve();