Lintcode 495. Implement Stack (Easy) (Python)

Implement Stack

Description:

Implement a stack. You can use any data structure inside a stack except stack itself to implement it.

Example
push(1)
pop()
push(2)
top() // return 2
pop()
isEmpty() // return true
push(3)
isEmpty() // return false

Code:

class Stack:
    stack = []
    """
    @param: x: An integer
    @return: nothing
    """
    def push(self, x):
        # write your code here
        self.stack.append(x)
    """
    @return: nothing
    """

    def pop(self):
        # write your code here
        return self.stack.pop()
    """
    @return: An integer
    """
    def top(self):
        # write your code here
        return self.stack[-1]
    """
    @return: True if the stack is empty
    """
    def isEmpty(self):
        # write your code here
        if self.stack:
            return False
        else:
            return True
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Dataset: Student Records We will implement stack using both array and linked list data structures to store student records. Each student record will have the following information: student name, student ID, and student GPA. 1. Stack using Array: We will use an array to implement stack data structure for storing student records. The array will have a fixed size, and we will use the push, pop, and peek operations to add, remove, and view the top element of the stack, respectively. The Java code for implementing stack using an array is given below: ``` public class StudentRecord { private String name; private int id; private double gpa; public StudentRecord(String name, int id, double gpa) { this.name = name; this.id = id; this.gpa = gpa; } // getters and setters public String toString() { return "Name: " + name + ", ID: " + id + ", GPA: " + gpa; } } public class StudentRecordStack { private StudentRecord[] stack; private int top; private int size; public StudentRecordStack(int size) { stack = new StudentRecord[size]; top = -1; this.size = size; } public void push(StudentRecord record) { if (top == size - 1) { System.out.println("Stack Overflow!"); return; } top++; stack[top] = record; } public StudentRecord pop() { if (top == -1) { System.out.println("Stack Underflow!"); return null; } StudentRecord record = stack[top]; top--; return record; } public StudentRecord peek() { if (top == -1) { System.out.println("Stack Underflow!"); return null; } return stack[top]; } public boolean isEmpty() { return top == -1; } public boolean isFull() { return top == size - 1; } } ``` To test the stack implementation, we can create a few student records and push them onto the stack: ``` public class Main { public static void main(String[] args) { StudentRecordStack stack = new StudentRecordStack(5); StudentRecord record1 = new StudentRecord("John", 1001, 3.5); StudentRecord record2 = new StudentRecord("Jane", 1002, 3.8); StudentRecord record3 = new StudentRecord("Bob", 1003, 3.2); stack.push(record1); stack.push(record2); stack.push(record3); System.out.println(stack.peek()); System.out.println(stack.pop()); System.out.println(stack.pop()); System.out.println(stack.pop()); } } ``` Output: ``` Name: Bob, ID: 1003, GPA: 3.2 Name: Bob, ID: 1003, GPA: 3.2 Name: Jane, ID: 1002, GPA: 3.8 Name: John, ID: 1001, GPA: 3.5 Stack Underflow! ``` 2. Stack using Linked List: We will use a linked list to implement stack data structure for storing student records. The linked list will have a dynamic size, and we will use the push, pop, and peek operations to add, remove, and view the top element of the stack, respectively. The Java code for implementing stack using a linked list is given below: ``` public class StudentRecordNode { private StudentRecord record; private StudentRecordNode next; public StudentRecordNode(StudentRecord record) { this.record = record; this.next = null; } // getters and setters } public class StudentRecordStack { private StudentRecordNode top; public StudentRecordStack() { top = null; } public void push(StudentRecord record) { StudentRecordNode node = new StudentRecordNode(record); node.next = top; top = node; } public StudentRecord pop() { if (top == null) { System.out.println("Stack Underflow!"); return null; } StudentRecord record = top.record; top = top.next; return record; } public StudentRecord peek() { if (top == null) { System.out.println("Stack Underflow!"); return null; } return top.record; } public boolean isEmpty() { return top == null; } } ``` To test the stack implementation, we can create a few student records and push them onto the stack: ``` public class Main { public static void main(String[] args) { StudentRecordStack stack = new StudentRecordStack(); StudentRecord record1 = new StudentRecord("John", 1001, 3.5); StudentRecord record2 = new StudentRecord("Jane", 1002, 3.8); StudentRecord record3 = new StudentRecord("Bob", 1003, 3.2); stack.push(record1); stack.push(record2); stack.push(record3); System.out.println(stack.peek()); System.out.println(stack.pop()); System.out.println(stack.pop()); System.out.println(stack.pop()); } } ``` Output: ``` Name: Bob, ID: 1003, GPA: 3.2 Name: Bob, ID: 1003, GPA: 3.2 Name: Jane, ID: 1002, GPA: 3.8 Name: John, ID: 1001, GPA: 3.5 Stack Underflow! ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值