摘要:
1 import java.util.Stack; 2 3 public class Parentheses { 4 public static boolean isParentheses(String s) { 5 Stack stack = new Stack(); 6 for (int i = 0; i < s.length(); i+... 阅读全文
摘要:
题干: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. 给定一个字符串,判断它是否回文,只考虑数字字母字符并忽略大小写。 For 阅读全文
摘要:
题干: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes co 阅读全文