package stack;
public class MyLinkListStack<T> implements MyStack<T>{
private Node top;
private int size;
public MyLinkListStack(){
top = null;
size = 0;
}
@Override
public void clear() {
top = null;
size = 0;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public boolean push(T data) {
Node node = new Node();
node.data = data;
node.pre = top;
top = node;
size ++;
return true;
}
@Override
public T pop() {
if(top != null){
Node node = top;
top = top.pre;
size--;
return node.data;
}
return null;
}
@Override
public int length() {
// TODO Auto-generated method stub
return size;
}
@Override
public void resize() {
// TODO Auto-generated method stub
}
private final class Node{
private Node pre;
private T data;
}
}
public class MyLinkListStack<T> implements MyStack<T>{
private Node top;
private int size;
public MyLinkListStack(){
top = null;
size = 0;
}
@Override
public void clear() {
top = null;
size = 0;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public boolean push(T data) {
Node node = new Node();
node.data = data;
node.pre = top;
top = node;
size ++;
return true;
}
@Override
public T pop() {
if(top != null){
Node node = top;
top = top.pre;
size--;
return node.data;
}
return null;
}
@Override
public int length() {
// TODO Auto-generated method stub
return size;
}
@Override
public void resize() {
// TODO Auto-generated method stub
}
private final class Node{
private Node pre;
private T data;
}
}