Update Solution.java

javadev · web-flow · commit f8030cc7d6cc · 2022-04-30T09:21:13.000+03:00
diff --git a/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/Solution.java b/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/Solution.java
@@ -6,14 +6,12 @@ public class Solution {
     public int minTrioDegree(int n, int[][] edges) {
         int[] degrees = new int[n + 1];
         int[][] adjMatrix = new int[n + 1][n + 1];
-
         for (int[] edge : edges) {
             adjMatrix[edge[0]][edge[1]] = 1;
             adjMatrix[edge[1]][edge[0]] = 1;
             degrees[edge[0]]++;
             degrees[edge[1]]++;
         }
-
         int minTrios = Integer.MAX_VALUE;
         for (int i = 1; i <= n; i++) {
             for (int j = i + 1; j <= n; j++) {
