Swift中的栈和队列

//栈是后进先出的结构
//栈结构的类
//支持push，pop，isEmpty，peek，size
class Stack {
    var stack: [AnyoBject]
    
    init() {
        stack = [AnyoBject]()
    }

    func push(object: AnyObject) -> Bool {
        return stack.append(object)
    }

    func pop() -> AnyObject? {
        if !isEmpty() {
            return stack.removeLast()
        } else {
            return nil
        }
    }

    func isEmpty() -> Bool {
        return stack.isEmpty
    }

    func peek() -> AnyObject? {
        return stack.last
    }

    func size() -> Int {
        return stack.count
    }
}

//队列是先进先出的类
//应用GCD,NSOperationQueue
//enqueue,dequeue,isEmpty,peek,size
class Queue {
    var queue: [AnyObject]
    
    init() {
        queue = [AnyObject]()
    }

    func enqueue(object: AnyObject) -> Bool {
        return queue.append(object)
    }
    
    func dequeue() -> AnyObject? {
        if !isEmpty() {
            return queue.removeFirst()
        } else {
            return nil

        }
    }
    
    func isEmpty() -> Bool {
        return queue.isEmpty
    }
    
    func peek() -> AnyObject? {
        return queue.first
    }

    func size() -> Int {
        return queue.count
    }

}