GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — leet-code/Java/Implement Stack.java at master · awangdev/leet-code Expand file tree/ Copy pathImplement Stack.javaMore file actions executable file ·69 lines (57 loc) · 1.2 KB / Copy pathImplement Stack.javaFile metadata and controlsexecutable file ·69 lines (57 loc) · 1.2 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 E 1525667761 tags: Stack 随便用一个data structure, implement stack. #### Stack, 先入, 后出 - ArrayList: return/remove ArrayList的末尾项。 - 2 Queues ``` /* LintCode Implement Stack 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 Tags Expand Array Stack */ /* Thoughts: use arraylist and a index tracker - leng push: add to end pop: remove end top: get end. isEmpty: return length */ class Stack { private ArrayList<Integer> list = new ArrayList<Integer>(); // Push a new item into the stack public void push(int x) { list.add(x); } // Pop the top of the stack public void pop() { if (list.size() > 0) { list.remove(list.size() - 1); } } // Return the top of the stack public int top() { if (list.size() > 0) { return list.get(list.size() - 1); } return -1; } // Check the stack is empty or not. public boolean isEmpty() { return list.size() == 0; } } ``` |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |