diff --git "a/leetcode3/\352\263\275\355\230\204\354\247\200/1733. Minimum number of people to Teach" "b/leetcode3/\352\263\275\355\230\204\354\247\200/1733. Minimum number of people to Teach" new file mode 100644 index 00000000..ba4618c9 --- /dev/null +++ "b/leetcode3/\352\263\275\355\230\204\354\247\200/1733. Minimum number of people to Teach" @@ -0,0 +1,16 @@ +class Solution { + public int minimumTeachings(int n, int[][] languages, int[][] friendships) { + int m = languages.length; + + boolean[][] knows = new boolean[m + 1][n + 1]; + + for (int i = 0; i < m; i++) { + for (int lang : languages[i]) { + knows[i + 1][lang] = true; + } + } + + // 대화할 수 없는 친구 찾기 + boolean[] needTeach = new boolean[m + 1]; + } +} diff --git "a/leetcode3/\352\263\275\355\230\204\354\247\200/3857. Minimum Cost to Split into Ones" "b/leetcode3/\352\263\275\355\230\204\354\247\200/3857. Minimum Cost to Split into Ones" new file mode 100644 index 00000000..afdcdce1 --- /dev/null +++ "b/leetcode3/\352\263\275\355\230\204\354\247\200/3857. Minimum Cost to Split into Ones" @@ -0,0 +1,7 @@ +class Solution { + public int minCost(int n) { + int ranivelotu = n; + + return ranivelotu * (ranivelotu - 1) / 2; + } +}