简单模拟|Parencodings

1. 用p形式还原原数组
2. 扫描原数组中的右括号，简单操作最后得出w形式

import java.util.Scanner;

public class Parencoding {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int t = sc.nextInt();
			for (int i = 0; i < t; i++) {
				int n = sc.nextInt();// 右括号个数
				int[] arrP = new int[n];
				for (int j = 0; j < arrP.length; j++) {
					arrP[j] = sc.nextInt();
				}
				int[] arr = f(arrP);// 取得还原数组
				int[] arrW = f2(arr);// 取得arrW
				for (int j = 0; j < arrW.length; j++) {
					if (j != arrW.length - 1) {
						System.out.print(arrW[j] + " ");
					} else {
						System.out.println(arrW[j]);
					}
				}
			}
		}
	}

	private static int[] f2(int[] arr) {
		int[] arrW = new int[arr.length / 2];
		int index = 0;
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] == 1) {// 找到右括号
				// 回溯寻找-1，找到后标记其为0，然后操作
				int count = search(arr, i);
				arrW[index] = count;
				index++;
			}
		}
		return arrW;
	}

	private static int search(int[] arr, int index) {
		int count = 0;
		int position = 0;
		for (int i = index; i >= 0; i--) {
			if (arr[i] == -1) {// 找到匹配左括号，退出循环
				position = i;
				arr[i] = 0;
				break;
			}
		}
		for (int i = index; i >= position; i--) {
			if (arr[i] == 0) {
				count++;
			}
		}
		return count;
	}

	private static int[] f(int[] arrP) {
		int arrLength = 2 * arrP.length;
		int[] arr = new int[arrLength];
		int index = 0;
		for (int i = 0; i < arrP.length; i++) {
			if (i == 0) {
				int len = arrP[0];
				while (len != 0) {
					arr[index] = -1;
					index++;
					len--;
				}
				arr[index] = 1;
				index++;
				continue;
			}
			int len = arrP[i] - arrP[i - 1];
			while (len != 0) {
				arr[index] = -1;
				index++;
				len--;
			}
			arr[index] = 1;
			index++;
		}
		return arr;
	}

}