摘要：
958. Check Completeness of a Binary Tree Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wik 阅读全文
posted @ 2018-12-16 12:53
Veritas_des_Liberty
阅读(226)
评论(0)
推荐(0)
摘要：
Given an m x n matrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top 阅读全文
posted @ 2018-12-15 22:21
Veritas_des_Liberty
阅读(249)
评论(0)
推荐(0)
摘要：
There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to 阅读全文
posted @ 2018-12-14 21:28
Veritas_des_Liberty
阅读(193)
评论(0)
推荐(0)
摘要：
There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to 阅读全文
posted @ 2018-12-13 21:33
Veritas_des_Liberty
阅读(217)
评论(0)
推荐(0)
摘要：
描述 在一个学生信息处理程序中，要求实现一个代表学生的类，并且所有成员变量都应该是私有的。 （注：评测系统无法自动判断变量是否私有。我们会在结束之后统一对作业进行检查，请同学们严格按照题目要求完成，否则可能会影响作业成绩。） 输入姓名，年龄，学号，第一学年平均成绩，第二学年平均成绩，第三学年平均成绩 阅读全文
posted @ 2018-12-13 20:25
Veritas_des_Liberty
阅读(884)
评论(0)
推荐(0)
摘要：
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bina 阅读全文
posted @ 2018-12-12 18:12
Veritas_des_Liberty
阅读(181)
评论(0)
推荐(0)
摘要：
Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Approach #1: C++. [recursive] Approach #2: Java. 阅读全文
posted @ 2018-12-11 21:51
Veritas_des_Liberty
阅读(168)
评论(0)
推荐(0)
摘要：
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2018-12-11 20:39
Veritas_des_Liberty
阅读(222)
评论(0)
推荐(0)
摘要：
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tick 阅读全文
posted @ 2018-12-11 16:51
Veritas_des_Liberty
阅读(241)
评论(0)
推荐(0)
摘要：
Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or do 阅读全文
posted @ 2018-12-11 13:11
Veritas_des_Liberty
阅读(239)
评论(0)
推荐(0)
浙公网安备 33010602011771号