题目:给出N(2~9)个数字,一数尾和另一数头相同可连接,求可连成的最大长度。
数据范围:每数2~6位,每位1~4。
例:123+234=1234 1234+4321=1234321
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class ConnectNum2 {
static int n;
static int mlen;
static boolean[] vis;
static int[][] nums;
static int[][] canc;
public static void main(String[] args) throws FileNotFoundException {
// TODO Auto-generated method stub
@SuppressWarnings("resource")
Scanner sc = new Scanner(System.in);
sc = new Scanner(new File("files/connectnum"));
int T = sc.nextInt();
for (int t = 0; t < T; t++) {
n = sc.nextInt();
nums = new int[n][2];
for (int i = 0; i < n; i++) {
nums[i][0] = sc.nextInt();
nums[i][1] = CacuLen(nums[i][0]);