华为校招机试 - 发广播（Java & JS & Python）

 

 

 

 

// 输入是一个n*n的二维矩阵
for(let i=0; i<n; i++) {
    for(let j=i+1; j<n; j++) {
        if(matrix[i][j] === '1') 更新并查集
    }
}

 

import java.util.Scanner;
 
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
 
    String[] matrix = sc.nextLine().split(",");
 
    System.out.println(getResult(matrix));
  }
 
  public static int getResult(String[] matrix) {
    int n = matrix.length;
 
    UnionFindSet ufs = new UnionFindSet(n);
 
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (matrix[i].charAt(j) == '1') {
          ufs.union(i, j);
        }
      }
    }
 
    return ufs.count;
  }
}
 
// 并查集实现
class UnionFindSet {
  int[] fa;
  int count;
 
  public UnionFindSet(int n) {
    this.fa = new int[n];
    for (int i = 0; i < n; i++) fa[i] = i;
    this.count = n;
  }
 
  public int find(int x) {
    if (x != this.fa[x]) {
      this.fa[x] = this.find(this.fa[x]);
      return this.fa[x];
    }
    return x;
  }
 
  public void union(int x, int y) {
    int x_fa = this.find(x);
    int y_fa = this.find(y);
 
    if (x_fa != y_fa) {
      this.fa[y_fa] = x_fa;
      this.count--;
    }
  }
}