codeTestPrac/queue.py at master · AMIVAYUN/codeTestPrac · GitHub

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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
# -*- coding: utf-8 -*-
"""
Created on Thu Apr 21 18:06:46 2022
@FileName: queue.py
@author: YUNJUSEOK
"""
import copy;
#FIFO
class Queue:
    def __init__( self ):
        self.content = [];

    def isEmpty( self ):
        return len( self.content ) == 0

    def enqueue( self ,item ):
        self.content.append( item );

    def dequeue( self ):
        if( self.isEmpty() ):
            raise Exception( "비어 있습니다. " );
        return self.content.pop( 0 );

    def peek( self ):
        if( self.isEmpty() ):
            raise Exception( "비어 있습니다. " );
        return self.content[ 0 ];

class CircleQueue:
    def __init__( self , size):
        self.content = [ 0 ] * size;
        self.front = 0;
        self.rear = 0;
        self.size = size;

    def isEmpty( self ):
        return self.front == self.rear;

    def isFull( self ):
        return self.front == ( self.rear + 1 ) % self.size

    def enqueue( self, item ):
        if( self.isFull() ):
            raise Exception( "사이즈를 넘었습니다. " );
        self.content[ self.rear ] = item;
        self.rear = ( self.rear +1 ) % self.size ;

    def dequeue( self ):
        if( self.isEmpty() ):
            raise Exception( "비어 있습니다. " );
        item = copy.deepcopy( self.content[ self.front ] );
        self.content[ self.front ] = 0;
        self.front = ( self.front + 1 ) % self.size;
        return item;
    def peek( self ):
        if( self.isEmpty() ):
            raise Exception( " 비어 있습니다 " );
        return self.content[ self.front ];

class Deque:
    def __init__( self, size ):
        self.content = [ 0 ] * size;
        self.front = 0;
        self.rear = 1;
        self.size = size;

    def isEmpty( self ):
        return self.front == self.rear;


    def isFull( self ):
        return self.front == ( self.rear + 1 ) % self.size

    def add_rear( self, item ):
        if( self.isFull() ):
            raise Exception( "사이즈를 넘었습니다. " );
        self.content[ self.rear ] = item;
        self.rear = ( self.rear + 1 ) % self.size;

    def delete_rear( self ):
        if( self.isEmpty() ):
            raise Exception( " 비어 있습니다. " );

        self.rear = ( self.rear - 1 + self.size ) % self.size;
        item = copy.deepcopy( self.content[ self.rear ] );
        self.content[ self.rear ] = 0;
        return item;

    def get_rear( self ):
        if( self.isEmpty() ):
            raise Exception(" 비어 있습니다. ");
        return self.content[ ( self.rear -1 +self.size ) % self.size ];

    def add_front( self, item ):
        if( self.isFull() ):
            raise Exception( " 사이즈를 넘었습니다 " );
        self.content[ self.front ] = item;
        self.front = ( self.front - 1 + self.size ) % self.size;

    def delete_front( self ):
        if( self.isEmpty() ):
            raise Exception( " 비어 있습니다. " );
        self.front = ( self.front + 1 ) % self.size;
        item = copy.deepcopy( self.content[ self.front ] );
        self.content[ self.front ] = 0;
        return item;
    def get_front( self ):
        if( self.isEmpty() ):
            raise Exception( " 비어 있습니다. ")
        return self.content[ ( self.front - 1 + self.size) % self.size ];


def main():
    queue = Queue();
    '''
    for i in range( 10 ):
        queue.enqueue( i );

    print ( queue.content );
    for i in range( 10 ):
        print ( queue.dequeue()) ;
    '''
    '''
    cqueue = CircleQueue( 11 );

    for i in range( 10 ):
        cqueue.enqueue( i );
        print( "rear: ", cqueue.rear );
    print( cqueue.content );
    print(" peek: ",cqueue.peek() );
    for i in range( 10 ):
        print ( cqueue.dequeue() );
        print( "front: ", cqueue.front );
    print( cqueue.content );
    '''
    dq = Deque( 10 );
    dq.add_front( 1 );
    print( dq.content, dq.front, dq.get_front() )
    dq.add_rear( 1 );
    dq.get_rear()
    print( dq.content, dq.rear ,dq.get_rear() )
if( __name__ == "__main__" ):
    main();