2018年6月13日
leetcode 119. Pascal's Triangle II
摘要： Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian 阅读全文
posted @ 2018-06-13 23:13 bonelee 阅读(201) 评论(0) 推荐(0)
leetcode 110. Balanced Binary Tree
摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep 阅读全文
posted @ 2018-06-13 22:32 bonelee 阅读(182) 评论(0) 推荐(0)
leetcode 232. Implement Queue using Stacks
摘要： Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
posted @ 2018-06-13 22:03 bonelee 阅读(235) 评论(0) 推荐(0)