- 博客(8)
- 资源 (1)
- 收藏
- 关注
原创 leetcode Symmetric Tree 镜面对称二叉树
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...
2019-08-20 17:47:19 184
原创 leetcode Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear onlyonce.Example 1:Input: 1->1->2Output: 1->2Example 2:Input: 1->1->2->3->3Output: 1-...
2019-08-20 16:54:11 102
原创 leetcode 二叉树是否平衡 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 depth of the two subtrees ofeverynode never diff...
2019-08-18 16:33:34 99
原创 leetcode 二叉树最深深度
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note:A leaf is a node with no childre...
2019-08-16 14:37:52 141
原创 leetcode 二叉树最低深度
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.Note:A leaf is a node with no childre...
2019-08-16 14:29:30 104
原创 leetcode Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211is read off as"one 1"or11.11is read off ...
2019-08-14 16:27:56 150
原创 request failed status:0 LAYA网络请求报错
这个报错原先一直以为是服务端报错,我在服务端找半天没有,发现是LAYA网络请求就没发送出来。前面提到,服务器在完成请求之后会在 XMLHttpRequest 的 onreadystatechange 属性中查找要调用的方法。这是真的,但还不完整。事实上,每当 HTTP 就绪状态改变时它都会调用该方法。这意味着什么呢?首先必须理解 HTTP 就绪状态。HTTP 就绪状态表示请求的状态或情...
2019-08-14 11:37:25 4976
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人