Description
On a social network consisting of m users 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 array languages, and an array friendships where:
- There are
n languages numbered 1 through n,
languages[i] is the set of languages the ith user knows, andfriendships[i] = [ui, vi] denotes a friendship between the users ui and vi.
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
x is a friend of
y and
y is a friend of
z, this doesn't guarantee that
x is a friend of
z.
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
Solutions
Solution 1: Simulation + Statistics
For each friendship, if the sets of languages known by the two people do not intersect, we need to teach one language so that they can communicate. We add these people to a hash set s.
Then, for each language, we count how many people in set s know that language and find the maximum count, denoted as mx. The answer is |s| - mx, where |s| is the size of set s.
The time complexity is O(m2 × k). Here, m is the number of languages, and k is the number of friendships.
PythonJavaC++GoTypeScriptRust
class Solution:
def minimumTeachings(
self, n: int, languages: List[List[int]], friendships: List[List[int]]
) -> int:
def check(u: int, v: int) -> bool:
for x in languages[u - 1]:
for y in languages[v - 1]:
if x == y:
return True
return False
s = set()
for u, v in friendships:
if not check(u, v):
s.add(u)
s.add(v)
cnt = Counter()
for u in s:
for l in languages[u - 1]:
cnt[l] += 1
return len(s) - max(cnt.values(), default=0)(code-box)
class Solution {
public int minimumTeachings(int n, int[][] languages, int[][] friendships) {
Set<Integer> s = new HashSet<>();
for (var e : friendships) {
int u = e[0], v = e[1];
if (!check(u, v, languages)) {
s.add(u);
s.add(v);
}
}
if (s.isEmpty()) {
return 0;
}
int[] cnt = new int[n + 1];
for (int u : s) {
for (int l : languages[u - 1]) {
++cnt[l];
}
}
int mx = 0;
for (int v : cnt) {
mx = Math.max(mx, v);
}
return s.size() - mx;
}
private boolean check(int u, int v, int[][] languages) {
for (int x : languages[u - 1]) {
for (int y : languages[v - 1]) {
if (x == y) {
return true;
}
}
}
return false;
}
}(code-box)
class Solution {
public:
int minimumTeachings(int n, vector<vector<int>>& languages, vector<vector<int>>& friendships) {
unordered_set<int> s;
auto check = [&](int u, int v) {
for (int x : languages[u - 1]) {
for (int y : languages[v - 1]) {
if (x == y) {
return true;
}
}
}
return false;
};
for (auto& e : friendships) {
int u = e[0], v = e[1];
if (!check(u, v)) {
s.insert(u);
s.insert(v);
}
}
if (s.empty()) {
return 0;
}
vector<int> cnt(n + 1);
for (int u : s) {
for (int& l : languages[u - 1]) {
++cnt[l];
}
}
return s.size() - ranges::max(cnt);
}
};(code-box)
func minimumTeachings(n int, languages [][]int, friendships [][]int) int {
check := func(u, v int) bool {
for _, x := range languages[u-1] {
for _, y := range languages[v-1] {
if x == y {
return true
}
}
}
return false
}
s := map[int]bool{}
for _, e := range friendships {
u, v := e[0], e[1]
if !check(u, v) {
s[u], s[v] = true, true
}
}
if len(s) == 0 {
return 0
}
cnt := make([]int, n+1)
for u := range s {
for _, l := range languages[u-1] {
cnt[l]++
}
}
return len(s) - slices.Max(cnt)
}(code-box)
function minimumTeachings(n: number, languages: number[][], friendships: number[][]): number {
function check(u: number, v: number): boolean {
for (const x of languages[u - 1]) {
for (const y of languages[v - 1]) {
if (x === y) {
return true;
}
}
}
return false;
}
const s = new Set<number>();
for (const [u, v] of friendships) {
if (!check(u, v)) {
s.add(u);
s.add(v);
}
}
const cnt = new Map<number, number>();
for (const u of s) {
for (const l of languages[u - 1]) {
cnt.set(l, (cnt.get(l) || 0) + 1);
}
}
return s.size - Math.max(0, ...cnt.values());
}(code-box)
use std::collections::{HashSet, HashMap};
impl Solution {
pub fn minimum_teachings(n: i32, languages: Vec<Vec<i32>>, friendships: Vec<Vec<i32>>) -> i32 {
fn check(u: usize, v: usize, languages: &Vec<Vec<i32>>) -> bool {
for &x in &languages[u - 1] {
for &y in &languages[v - 1] {
if x == y {
return true;
}
}
}
false
}
let mut s: HashSet<usize> = HashSet::new();
for edge in friendships.iter() {
let u = edge[0] as usize;
let v = edge[1] as usize;
if !check(u, v, &languages) {
s.insert(u);
s.insert(v);
}
}
let mut cnt: HashMap<i32, i32> = HashMap::new();
for &u in s.iter() {
for &l in &languages[u - 1] {
*cnt.entry(l).or_insert(0) += 1;
}
}
let mx = cnt.values().cloned().max().unwrap_or(0);
(s.len() as i32) - mx
}
}(code-box)
