FilesExpand file tree

 master

/

MyArrayQueue.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

75 lines (60 loc) · 1.51 KB

 master

/

MyArrayQueue.java

Copy path

Top

File metadata and controls

• Code
• Blame

75 lines (60 loc) · 1.51 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

64

65

66

67

68

69

70

71

72

73

74

75

package ch03;

import java.lang.Iterable;

import java.util.Iterator;

/**

* Created by cookfront on 2017/3/2.

*

* 数组实现的队列

*/

public class MyArrayQueue<AnyType> implements Iterable<AnyType> {

private static final int DEFAULT_CAPACITY = 10;

private int topOfStack;

private AnyType[] theItems;

private int theSize;

public MyArrayQueue() {

doClear();

}

private void doClear() {

theSize = 0;

topOfStack = -1;

ensureCapacity(DEFAULT_CAPACITY);

}

public int size() {

return theSize;

}

public boolean isEmpty() {

return theSize == 0;

}

public void push(AnyType val) {

if (theItems.length == size()) {

ensureCapacity(size() * 2 + 1);

}

theItems[++topOfStack] = val;

}

public AnyType pop() {

return theItems[--topOfStack];

}

public void ensureCapacity(int newCapacity) {

if (newCapacity < theSize) {

return;

}

AnyType[] old = theItems;

theItems = (AnyType []) new Object[newCapacity];

for (int i = 0; i < size(); i++) {

theItems[i] = old[i];

}

}

public Iterator<AnyType> iterator() {

return new ArrayQueueIterator();

}

private class ArrayQueueIterator implements Iterator<AnyType> {

@Override

public boolean hasNext() {

return false;

}

@Override

public AnyType next() {

return null;

}

}

}