-
编辑 删除
我要长高！！坚持就是胜利！（2）
增高是很多个子不高的朋友的梦想，如何能够快速增高呢？小编今天教你一个能够轻松有效增高的秘诀。那就是增高瑜伽——增延脊柱式。它的前屈位不仅锻炼了我们的腹部肌肉，更重要的是拉伸了我们的脊柱。通过坚持做这个动作，经常锻炼我们的脊柱，能够有效地把它拉伸，把身高“拉长”哦！1）双脚并拢，抬举双手并高举过头，呼气，双手打开与肩同宽，带动身体，身体往前，往下。2）指尖触地，保持抬头状态，双脚绷直。3）然后双手抓...
-
编辑 删除
[LeetCode] Wildcard Matching
Wildcard MatchingImplement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character. '*' Matches...
-
编辑 删除
[LeetCode] Jump Game II
Jump Game IIGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your go...
-
编辑 删除
[LeetCode] Regular Expression Matching
Regular Expression MatchingImplement regular expression matching with support for '.' and '*'.'.' Matches any single character. '*'&...
-
编辑 删除
[LeetCode] Search a 2D Matrix
Search a 2D MatrixWrite an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to r...
-
编辑 删除
[LeetCode] Basic Calculator II
Basic Calculator IIImplement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, and / operators. The integer divisi...
-
编辑 删除
[LeetCode] Single Number II
Single Number IIGiven an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you impl...
-
编辑 删除
[LeetCode] Path Sum II
Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, &...
-
编辑 删除
[LeetCode] Rotate List
Rotate ListGiven a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,r...
-
编辑 删除
[LeetCode] Single Number
Single NumberGiven an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it ...
-
编辑 删除
[LeetCode] Contains Duplicate III
Contains Duplicate IIIGiven an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and n...
-
编辑 删除
[LeetCode] Word Break
Word BreakGiven 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] Rectangle Area
Rectangle AreaFind the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figur...
-
编辑 删除
[LeetCode] Count Complete Tree Nodes
Count Complete Tree NodesGiven a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possib...
-
编辑 删除
Win Phone 8.1 模拟器联网
环境：windows 8 server版本，vs2013状况：模拟器不能联网，而宿主主机联网正常。解决办法：（1）打开Hyper-V Manager，找到自己的模拟器（我们用服务器多用户开发，找到自身的那个即可）。（2）右键-》设置，在弹出的框中，添加一些虚拟网卡。一般默认会有几个。（3）打开互联网共享中心，找到实际的网卡，属性，选择共享标签，勾选允许其他互联网用户连接网络，选择其中一个虚拟网卡，...
-
编辑 删除
[LeetCode] Basic Calculator
Basic CalculatorImplement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sig...
-
编辑 删除
[LeetCode] Invert Binary Tree
Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \ ...
-
编辑 删除
[LeetCode] Implement Stack using Queues
Implement Stack using QueuesImplement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top elemen...
-
编辑 删除
[LeetCode] Linked List Cycle II
Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?解题思路：1、解法1，用set来存储所有已经出现的指针...
-
编辑 删除
[LeetCode] Linked List Cycle
Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?解题思路：1、最基本的办法是用一个set来存储所有已经出现过的指针。若出现重复，则表示有环，若没有重复，则没有环。/** * ...
