描述:
現(xiàn)在,有一行括號(hào)序列,請(qǐng)你檢查這行括號(hào)是否配對(duì)。
3[(])(])([[]()])
NoNoYes
import java.util.Scanner;public class No2 { PRivate String checkout(String str) { try { StringBuffer asb = new StringBuffer(str); // 模擬棧A StringBuffer bsb = new StringBuffer(); // 模擬棧B int length = asb.length(); while (length > 0) { // 遇右括號(hào),移A入B if (asb.charAt(length - 1) == ')' || asb.charAt(length - 1) == ']') { bsb.append(asb.charAt(length - 1)); asb.deleteCharAt(length - 1); length = asb.length(); continue; } // 遇左括號(hào),若無(wú)法與B中棧頂元素合法匹配,則序列非法;若合法匹配,移A移B if (asb.charAt(length - 1) == '(') { if (bsb.charAt(bsb.length() - 1) != ')') { return "No"; } else { asb.deleteCharAt(asb.length() - 1); bsb.deleteCharAt(bsb.length() - 1); length = asb.length(); continue; } } if (asb.charAt(length - 1) == '[') { if (bsb.charAt(bsb.length() - 1) != ']') { return "No"; } else { asb.deleteCharAt(asb.length() - 1); bsb.deleteCharAt(bsb.length() - 1); length = asb.length(); continue; } } } if (bsb.length() == 0) { return "Yes"; } } catch (RuntimeException e) { } return "No"; } public static void main(String args[]) throws Exception { try { Scanner cin = new Scanner(System.in); int num = cin.nextInt(); String[] result = new String[num]; No2 no2 = new No2(); for (int i = 0; i < num; i++) { String str = cin.next(); result[i] = no2.checkout(str); } for (int i = 0; i < num; i++) { System.out.println(result[i]); } } catch (RuntimeException e) { } }}
新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注