Class Solution
- java.lang.Object
-
- g1701_1800.s1733_minimum_number_of_people_to_teach.Solution
-
public class Solution extends Object
1733 - Minimum Number of People to Teach.Medium
On a social network consisting of
musers and some friendships between users, two users can communicate with each other if they know a common language.You are given an integer
n, an arraylanguages, and an arrayfriendshipswhere:- There are
nlanguages numbered1throughn, languages[i]is the set of languages theithuser knows, andfriendships[i] = [ui, vi]denotes a friendship between the usersuiandvi.
You can choose one language and teach it to some users so that all friends can communicate with each other. Return the minimum number of users you need to teach.
Note that friendships are not transitive, meaning if
xis a friend ofyandyis a friend ofz, this doesn’t guarantee thatxis a friend ofz.Example 1:
Input: n = 2, languages = [[1],[2],[1,2]], friendships = [[1,2],[1,3],[2,3]]
Output: 1
Explanation: You can either teach user 1 the second language or user 2 the first language.
Example 2:
Input: n = 3, languages = [[2],[1,3],[1,2],[3]], friendships = [[1,4],[1,2],[3,4],[2,3]]
Output: 2
Explanation: Teach the third language to users 1 and 3, yielding two users to teach.
Constraints:
2 <= n <= 500languages.length == m1 <= m <= 5001 <= languages[i].length <= n1 <= languages[i][j] <= n1 <= ui < vi <= languages.length1 <= friendships.length <= 500- All tuples
(ui, vi)are unique languages[i]contains only unique values
- There are
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description intminimumTeachings(int n, int[][] languages, int[][] friendships)
-