初学算法,一直困扰于栈和队列,于是自己编写了一部分栈的代码
基于数组实现:
package Test;
import java.util.Iterator;
//基于数组的下压栈
//使用泛型 即栈中可存放任意数据类型 如String,Interger等
//实现Iterable<Item>泛型接口,方便遍历
public class ArrayStack<Item> implements Iterable<Item>{
private int N; //数组元素个数private Item[] a;
//初始化泛型数组
a=(Item[]) new Object[size];
}
//判断栈是否为空
return N==0;
}
//返回栈大小
return N;
}
//栈的扩容(如遇到入栈栈满情况,可进行扩容)
public void resize(int max){Item[] temp=(Item[]) new Object[max];
for(int i=0;i<N;i++){
temp[i]=a[i];
}
a=temp;
}
//入栈
public void push(Item item){if(N==a.length){
resize(2*a.length);
}
a[N++]=item;
}
//出栈(此处为了防止数组栈被浪费,即当元素个数小于数组的4分之一时,自动将数组的大小减半,可忽略)
public Item pop(){Item item=a[--N];
if(N>0 && N<=a.length/4){
resize(a.hashCode()/2);
}
return item;
}
//复写 iterator()方法(方便遍历)
@Override
public Iterator<Item> iterator() {
// TODO Auto-generated method stub
return new ArrayIterator();
}
public class ArrayIterator implements Iterator<Item>{
private int i=N;
@Override
public boolean hasNext() {
// TODO Auto-generated method stub
return i>0;
}
@Override
public Item next() {
// TODO Auto-generated method stub
return a[--i];
}
@Override
public void remove() {
// TODO Auto-generated method stub
}
}
public static void main(String args[]){
}
}
基于链表(举例:括号匹配)
//链表栈实现比较简单,参考代码,本人初学者,有不妥地方忘见谅
package Test;
import java.util.Iterator;
public class stack<Item> implements Iterable<Item>{
private int N;
private Node First;
private class Node{
Item item;
Node next;
}
public boolean isEmpty(){
return First==null;
}
public int size(){
return N;
}
public void insert(Item item){
Node old=First;
First=new Node();
First.item=item;
First.next=old;
N++;
}
public Item del(){
if(!isEmpty()){
Item temp=First.item;
First=First.next;
N--;
return temp;
}
return null;
}
@Override
public Iterator<Item> iterator() {
// TODO Auto-generated method stub
return null;
}
private class LinkIterator implements Iterator<Item>{
private Node temp=First;
@Override
public boolean hasNext() {
// TODO Auto-generated method stub
return temp!=null;
}
@Override
public Item next() {
// TODO Auto-generated method stub
Item item=temp.item;
temp=temp.next;
return item;
}
@Override
public void remove() {
// TODO Auto-generated method stub
}}
public static void main(String args[]){
System.out.print(A("{(())[]}"));
}
private static int A(String temp) {
stack<String> stack=new stack<String>();
char[] ch=temp.toCharArray();
for(int i=0;i<ch.length;i++){
if(ch[i]=='{'){
stack.insert("{");
}
if(ch[i]=='('){
stack.insert("(");
}
if(ch[i]=='['){
stack.insert("[");
}
if(ch[i]==')'){
if(stack.del()!="("){
System.out.print("No");
return -1;
};
}
if(ch[i]=='}'){
if(stack.del()!="{"){
System.out.print("No");
return -1;
};
}
if(ch[i]==']'){
if(stack.del()!="["){
System.out.print("No");
return -1;
};
}
}
if(stack.isEmpty()) {
System.out.print("OK");
return 0;
}
else{System.out.print("No");
return -1;}
}
}