FilesExpand file tree

 master

/

StackBaseArray.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

64 lines (54 loc) · 1.61 KB

 master

/

StackBaseArray.java

Top

File metadata and controls

• Code
• Blame

64 lines (54 loc) · 1.61 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package Stack;

/**

* 顺序栈(基于数组实现)

* Author: PeiJiaNi

*/

public class StackBaseArray {

private int[] items; // 数组

private int count; // 栈中元素个数

private int length; // 栈空间大小

public StackBaseArray(int capactiy) {

this.items = new int[capactiy];

this.count = 0;

this.length = capactiy;

}

/**

* 入栈操作 时间复杂度O(1)

* @param item 要入栈的元素

* @return 入栈成功则返回true,否则返回false

*/

public boolean push(int item) {

if(count == length) {

System.out.println("当前栈已满，无法进行入栈操作");

return false;

}

items[count] = item;

++count;

return true;

}

/**

* 出栈操作 时间复杂度O(1)

* @return 如果栈内不为空，则返回栈顶元素，否则返回-1

*/

public int pop(){

if(count == 0) {

System.out.println("当前栈已空，无法进行出栈操作");

return -1;

}

// 返回下标为 count-1 的数组元素，并且栈中元素个数count-1

return items[--count];

}

public static void main(String[] args){

StackBaseArray stack = new StackBaseArray(6);

stack.push(1);

stack.push(2);

stack.push(3);

stack.push(4);

stack.push(5);

System.out.println(stack.pop());

System.out.println(stack.pop());

System.out.println(stack.pop());

System.out.println(stack.pop());

System.out.println(stack.pop());

}

}