-
编辑 删除
[LeetCode] Symmetric Tree
Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 /&nb...
-
编辑 删除
[LeetCode] Add and Search Word - Data structure design
Add and Search Word - Data structure designDesign a data structure that supports the following two operations:void addWord(word) bool search(word)search(word) can search a literal word or a...
-
编辑 删除
万晓利-女儿情
万晓利版的女儿情，正在练习中。先把谱子记下来。教学视频：万晓利版本：万晓利原版吉他谱：教学版本吉他谱：
-
编辑 删除
[LeetCode] Same Tree
Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.解题思路：递归做即...
-
编辑 删除
[LeetCode] Merge Sorted Array
Merge Sorted ArrayGiven two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough spa...
-
编辑 删除
[LeetCode] Course Schedule II
Course Schedule IIThere 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 first ...
-
编辑 删除
溪行桃花源-李志辉
-
编辑 删除
[LeetCode] Maximum Depth of Binary Tree
Maximum Depth of Binary TreeGiven 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.解题思路：这道题就是求二叉树...
-
编辑 删除
[LeetCode] Binary Tree Level Order Traversal
Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {...
-
编辑 删除
CSDN博客进入前1w名，mark！
CSDN博客进入前1w名，mark一下！仍然任重而道远！
-
编辑 删除
[LeetCode] Permutations
PermutationsGiven a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], an...
-
编辑 删除
C# JavaScriptSerializer报错，json数据太长
ASP.NET平台中，用JavaScriptSerializer将返回的数据序列化，若返回的数据非常大，则可能会报如下错误：Exception information: Exception type: InvalidOperationException Exception message: Error duri...
-
编辑 删除
[LeetCode] Permutations II
Permutations IIGiven a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1...
-
编辑 删除
[LeetCode] Balanced Binary Tree
Balanced Binary TreeGiven 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 of e...
-
编辑 删除
[LeetCode] Pascal's Triangle II
Pascal's Triangle IIGiven an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm...
-
编辑 删除
[LeetCode] Minimum Size Subarray Sum
Minimum Size Subarray SumGiven an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return ...
-
编辑 删除
[LeetCode] Minimum Depth of Binary Tree
Minimum Depth of Binary TreeGiven 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.解题思路：这里的深度表示叶子...
-
编辑 删除
[LeetCode] Implement Trie (Prefix Tree)
Implement Trie (Prefix Tree)Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.解题思路：前缀树。由于值设...
-
编辑 删除
我觉得自己好傻
《我觉得自己好傻》 在她面前 我觉得我自己好傻 那么放肆又幼稚 却一点都不怕 她问我为什么总是笑开了花 为什么总是默默地不说话 我也不知道自己怎么了 也许，默契就是这样吧 告诉你们 她最后跟别人走啦 回想起来当初是不是应该多点成熟 而不是在她面前做个傻瓜？ 不过如果可以...
-
编辑 删除
Azure云平台学习之路（三）——Cloud Services
1、什么是云服务？能够部署高度可用的且可无限缩放的应用程序和API。简而言之，就是你写的CMD程序按照一定的框架进行少量修改就能运行在Azure云平台上。2、Azure云服务有什么特点？（1）专注应用程序而不是硬件，PaaS的一种。（2）支持多种框架和语言。（3）集成了运行状况监视和负载平衡。（4）自动缩放优化成本和性能3、建立云服务之前，我们需要建立一个云存储，来记录我们的程序的日志信息（当然，...
