fix: update java code

Author: yanglbme

solution/0700-0799/0721.Accounts Merge/README.md

@@ -179,7 +179,8 @@ class Solution {
         Map<Integer, Set<String>> g = new HashMap<>();
         for (int i = 0; i < n; ++i) {
             int root = uf.find(i);
-            g.computeIfAbsent(root, k -> new HashSet<>()).addAll(accounts.get(i).subList(1, accounts.get(i).size()));
+            g.computeIfAbsent(root, k -> new HashSet<>())
+                .addAll(accounts.get(i).subList(1, accounts.get(i).size()));
         }
         List<List<String>> ans = new ArrayList<>();
         for (var e : g.entrySet()) {

solution/0700-0799/0721.Accounts Merge/README_EN.md

@@ -177,7 +177,8 @@ class Solution {
         Map<Integer, Set<String>> g = new HashMap<>();
         for (int i = 0; i < n; ++i) {
             int root = uf.find(i);
-            g.computeIfAbsent(root, k -> new HashSet<>()).addAll(accounts.get(i).subList(1, accounts.get(i).size()));
+            g.computeIfAbsent(root, k -> new HashSet<>())
+                .addAll(accounts.get(i).subList(1, accounts.get(i).size()));
         }
         List<List<String>> ans = new ArrayList<>();
         for (var e : g.entrySet()) {

solution/0700-0799/0721.Accounts Merge/Solution.java

@@ -52,7 +52,8 @@ public List<List<String>> accountsMerge(List<List<String>> accounts) {
         Map<Integer, Set<String>> g = new HashMap<>();
         for (int i = 0; i < n; ++i) {
             int root = uf.find(i);
-            g.computeIfAbsent(root, k -> new HashSet<>()).addAll(accounts.get(i).subList(1, accounts.get(i).size()));
+            g.computeIfAbsent(root, k -> new HashSet<>())
+                .addAll(accounts.get(i).subList(1, accounts.get(i).size()));
         }
         List<List<String>> ans = new ArrayList<>();
         for (var e : g.entrySet()) {