队列
i-Blue
抱平常心走平常路
展开
-
队列的两种存储结构
从数据的存储结构来划分,队列结构可以分成两类:顺序队列结构:即使用一组地址连续的内存单元依次保存队列中的数据。在程序中,可以定义一个指定大小的结构数组来作为队列。struct DATA{ int x; int y;};struct MyQueue{ DATA data[len]; int head; int tail;};链式队列结构:即使用链表形式保存队列中原创 2016-05-15 17:37:59 · 2135 阅读 · 0 评论 -
101. Symmetric Tree--DFS(递归)/BFS(queue+迭代)
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2016-11-02 17:44:33 · 497 阅读 · 0 评论 -
378. Kth Smallest Element in a Sorted Matrix-binary search/heap
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.Note that it is the kth smallest element in the sorted order, not原创 2017-02-18 11:56:36 · 316 阅读 · 0 评论