38 lines
1.3 KiB
C++
38 lines
1.3 KiB
C++
#include <gtest/gtest.h>
|
||
|
||
#include "jianzhi_offer.h"
|
||
|
||
/**
|
||
* 用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )
|
||
* 作者：Krahets
|
||
* 链接：https://leetcode.cn/leetbook/read/illustration-of-algorithm/5d3i87/
|
||
* 来源：力扣（LeetCode）
|
||
* 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。
|
||
*/
|
||
TEST(QueueWithTwoStackTest, BasicAssertions) {
|
||
/**
|
||
* 示例 1：
|
||
* 输入：
|
||
* ["CQueue","appendTail","deleteHead","deleteHead","deleteHead"]
|
||
* [[],[3],[],[],[]]
|
||
* 输出：[null,null,3,-1,-1]
|
||
*/
|
||
yaha::CQueue c_queue_1;
|
||
c_queue_1.append_tail(3);
|
||
ASSERT_EQ(c_queue_1.delete_head(), 3);
|
||
ASSERT_EQ(c_queue_1.delete_head(), -1);
|
||
ASSERT_EQ(c_queue_1.delete_head(), -1);
|
||
/**
|
||
* 输入：
|
||
* ["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
|
||
* [[],[],[5],[2],[],[]]
|
||
* 输出：[null,-1,null,null,5,2]
|
||
*/
|
||
yaha::CQueue c_queue_2;
|
||
ASSERT_EQ(c_queue_2.delete_head(), -1);
|
||
c_queue_2.append_tail(5);
|
||
c_queue_2.append_tail(2);
|
||
ASSERT_EQ(c_queue_2.delete_head(), 5);
|
||
ASSERT_EQ(c_queue_2.delete_head(), 2);
|
||
}
|