华为od统一考试B卷【密钥格式化】Java 实现

题目

思路

code

import java.util.Scanner;
import java.util.*;
import java.util.stream.Stream;
import java.util.HashMap;
public class Main {
	public static void main(String[] args) {
        // 处理输入
        Scanner in = new Scanner(System.in);
        int k = in.nextInt();
        String input_str = in.next();
        String[] strs = input_str.split("-");
        String first = strs[0];
        String temp = "";
        for (int i = 1; i < strs.length; i++) {
            temp += strs[i];
        }
        String[] chars = temp.split("");
        String result = "";
        result += first;
        for (int i = 0; i < chars.length; i++) {
            String v = chars[i].toUpperCase();
            if (i % k == 0) {
                v = "-" + v;
            }
             result+=v;
        }
        System.out.println(result);
        return;
    }
}
 
// 并查集模板
class UF {
  int[] item;
  int result;
  public UF(int n) {
    item = new int[n + 1];
    result = n;
    for (int i = 0; i < n; i++) item[i] = i;
  }
  public int find(int x) {
    if (x != item[x]) {
      return (item[x] = find(item[x]));
    }
    return x;
  }
  public void union_connect(int x, int y) {
    int x_item = find(x);
    int y_item = find(y);
    if (x_item != y_item) {
      item[y_item] = x_item;
      result--;
    }
  }
}

要求