xiao___lu的博客

package luyunzhou.one;import java.util.Iterator; import java.util.Scanner;public class StackDemo { public static void main(String[] args) { stack <String>st = new stack<String>(); Sc

package luyunzhou.one;import java.awt.EventQueue; import java.util.Scanner;public class QueueDemo { public static void main(String[] args) { // TODO Auto-generated method stub Scanne

括号匹配package luyunzhou.one;import java.util.Scanner; import java.util.Stack;public class Parentheses { public static void main(String[] args) { // TODO Auto-generated method stub Stac

利用栈转换二进制package luyunzhou.one;import java.util.Stack;public class Bin { public static void main(String[] args) { // TODO Auto-generated method stub int N = 50; Stack<Integer>

更改队列里数组大小。未解决，书上更改栈例题好像有问题。package luyunzhou.one;import java.util.Scanner; /** * 未解决 * * */ public class Answer1314unfinished { public static void main(String[] args) { // TODO Auto-gen

利用栈补全左括号package luyunzhou.one;import java.util.Scanner; import java.util.Stack;public class Answer139 { public static void main(String[] args) { // TODO Auto-generated method stub St

链表综合package luyunzhou.one;import java.util.Scanner; /** * 1.3.19~1.3.30无29 * */ public class Answer1319 { public static void main(String[] args) { // TODO Auto-generated method stub

实例变量只有一个last来实现环形列表。 不会 先占坑:(

union－find前几道package luyunzhou.one;public class Answer151 { public static void main(String[] args) { // TODO Auto-generated method stub /*－－－－－－－－－－－－－－－－1.5.1－－－－－－－－－－－－－－－－