-
编辑 删除
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、建立云服务之前，我们需要建立一个云存储，来记录我们的程序的日志信息（当然，...
-
编辑 删除
[LeetCode] Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a ca...
-
编辑 删除
[LeetCode] Pascal's Triangle
Pascal's TriangleGiven numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1],  ...
-
编辑 删除
Azure云平台学习之路（二）——SQL Database
1、什么是SQL Database?托管关系数据库，数据库即服务，IaaS的一种。2、有哪些特点？（1）为SaaS应用提供可扩展的数据存储服务。（2）易于操作大量的数据库。稍后介绍几种操作数据库的方法。（3）性能更高，稳定性更好。基于Azure平台，高性能可扩展；多地区容灾备份。（4）接近0维护，无需维护其他硬件设备。（5）支持熟悉的功能、工具和平台。（6）安全和审核功能。3、使用的企业有：4、创...
-
编辑 删除
[LeetCode] Remove Duplicates from Sorted List
Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1-...
-
编辑 删除
[LeetCode] Course Schedule
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 first take course 1, whi...
-
编辑 删除
[LeetCode] Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?解题思路：动态规划，类似于斐波那契数列。X X X....
-
编辑 删除
Azure云平台学习之路（一）——Azure简介
1、什么是Azure？Microsoft Azure是由微软所发展的一套云计算操作系统（云平台），提供各种优质的服务：计算、存储、数据、网络和应用程序。Azure意为天蓝色、蔚蓝色。2、Azure特点？（1）平台即服务（Platform as a Service，PaaS）+ 基础架构即服务（Infrastructure as a Service，IaaS）。 &...
-
编辑 删除
[LeetCode] Multiply Strings
Multiply StringsGiven two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.解题思路：按照小学的做法，每位相加即可。这里我定义了两个函...
-
编辑 删除
[LeetCode] Trapping Rain Water
Trapping Rain WaterGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Giv...
