2016年04月_MSP_甄心cherish

12月 08月 07月 06月 05月 04月 01月

原创 LeetCode-104.Maximum Depth of Binary Tree

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.递归：public int MaxDepth(TreeN

2016-04-21 17:25:42 455

原创 LeetCode-139.Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"

2016-04-21 13:51:34 310

原创 LeetCode-83.Remove Duplicates from Sorted List

Given 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->1->2->3->3, return 1->2->3./** * Definition

2016-04-20 18:27:16 302

原创 LeetCode-145.Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recursive solut

2016-04-20 16:20:08 402

原创 LeetCode-98.Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th

2016-04-20 14:58:24 427

原创 LeetCode-94.Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio

2016-04-19 16:46:55 372

原创 LeetCode-144.Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti

2016-04-19 15:49:11 322

原创 LeetCode-226.Invert Binary Tree

Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howe

2016-04-19 14:49:09 383

原创 LeetCode-120.Triangle

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [

2016-04-19 09:52:58 344

原创 LeetCode-51&52.N-Queens

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.

2016-04-17 19:33:09 462

原创 LeetCode-39&40&216.Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numb

2016-04-16 22:24:23 541

原创 LeetCode-283.Move Zeroes

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you

2016-04-14 22:04:01 395

原创 LeetCode-62&63.Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the

2016-04-11 22:45:44 520

原创 LeetCode-236.Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two node

2016-04-11 13:31:54 386

原创 LeetCode-235.Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw

2016-04-11 10:17:29 360

原创 LeetCode-279.Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =

2016-04-10 23:49:27 473

原创 LeetCode-206&92.Reverse Linked List

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy the

2016-04-10 22:21:48 520

原创 LeetCode-129.Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota

2016-04-09 18:51:50 410

原创 Windows 10 Mobile Build 14295 备份微信记录方法

每个人的微信里可能存放的珍贵的聊天记录，然而WP的微信取消了聊天记录迁移，却没有提供其他聊天记录备份方法。因为十分珍惜与那谁的微信聊天记录，才有了这篇教程贴。在之前的Build版本中我写过备份记录的方法(http://blog.csdn.net/zmq570235977/article/details/48835701)，不过在14295不完全可用，所以做了一些修改。废话有点多，进入正题。

2016-04-07 14:29:04 1467

原创 LeetCode-100.Same Tree

Given 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./** * De

2016-04-06 16:16:33 361

原创 LeetCode-217&219&220.Contains Duplicate

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and jis at most k.publi

2016-04-05 20:31:54 353

原创 LeetCode-16.3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact

2016-04-05 19:52:34 373

原创 LeetCode-15.3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c

2016-04-05 16:04:11 332

原创 LeetCode-38.Count and Say

The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as

2016-04-05 12:38:23 331

原创 LeetCode-24.Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y

2016-04-04 17:07:28 429

原创 LeetCode-20.Valid Parentheses

Problem:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}"

2016-04-04 14:28:51 276

原创 hihocoder-#1094 : Lost in the City

#1094 : Lost in the City时间限制:10000ms单点时限:1000ms内存限制:256MB描述Little Hi gets lost in the city. He does not know where he is. He does not know which direction is north.Fo

2016-04-04 13:19:46 619

原创 hihocoder-#1082 : 然而沼跃鱼早就看穿了一切

#1082 : 然而沼跃鱼早就看穿了一切时间限制:1000ms单点时限:1000ms内存限制:256MB描述fjxmlhx每天都在被沼跃鱼刷屏，因此他急切的找到了你希望你写一个程序屏蔽所有句子中的沼跃鱼(“marshtomp”，不区分大小写)。为了使句子不缺少成分，统一换成 “fjxmlhx” 。输入输入包括多行。

2016-04-03 18:18:25 971

JPEG压缩神器

【摄友Hold住！JPEG压缩神器】以色列科技公司ICTV开发出的一种能够优化JPEG压缩的方法。软件自动分析一张照片在对画质不产生可见损失前提下可用的最大压缩率。ICTV称该方法预计可以将照片体积缩小50%-80%。

2014-12-16

WP8 下载网络音频到独立存储空间中播放示例

代码详解： http://blog.csdn.net/zmq570235977/article/details/20702729

2014-03-07

推荐一个很好用的PDF编辑器程序可以帮助您有效地编辑PDF文件！它是世界上最好的和最好用的PDF编辑软件，很容易的即时编辑PDF文件。现在，您可以有效地使用的PDF编辑器程序以你自己的意愿读取和写入PDF格式文本，内容，图片，图片。但是网上的版本打开时会有未注册的对话框,并且编辑过后的PDF文档每一页的右上角会带上"由Foxit PDF Editor 编辑版权所有(c) by Foxit Software Company,2003-2009 仅用于评估"的红色标记. 这是我修改后的版本,去掉了未注册的对话框和标记

2012-10-06

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

MSP_甄心cherish的专栏