1.数组：matrix == null || matrix.length == 0 || matrix[0].length == 0;

2.栈：while(!stack.isEmpty())

3.队列：队列为空：rear == front, 队满：(rear + 1) % queaSize = front;

4.双指针: while(l < r)