Implement Stack Using LinkedList

import java.io.*;
import java.util.*;

/*
 * To execute Java, please define "static void main" on a class
 * named Solution.
 *
 * If you need more classes, simply define them inline.
 */

interface Stack<T> {
    void push(T ele);
    T pop();
}


class StackLinkedlist<T> implements Stack<T> {
  private Node head = null;
  private class Node{
     private T data;
     private Node next;
    
     public Node (T data){
          this.data = data;
          this.next = null;
     }
  }
  
  
  public void push(T val){
    Node node = new Node(val);
    node.next = head;
    head = node;
    
  }
  
  public T pop() {
     if (head == null) {
       return null;
     }
     T value = head.data;
     head = head.next;
    
     return value;
  }
  
}



class Solution {
  public static void main(String[] args) {
    Stack<Integer> test = new StackLinkedlist<Integer>();
    test.push(1);
    test.push(2);
    test.push(3);
    System.out.println(test.pop());
    System.out.println(test.pop());
    System.out.println(test.pop());
    System.out.println(test.pop());
   
  }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值