/** * ID: 129 * Name: Sum Root to Leaf Numbers * Data Structure: * Time Complexity: * Space Complexity: * Tag: Tree * Difficult: Medium * Algorithm...
分类：
其他好文 时间：
2015-06-04 08:34:32
阅读次数：
108
Android把屏幕大小分成四种：small, normal, large, xlarge;
屏幕密度分成：low(ldpi), medium(mdpi), high(hdpi), extra high(xhdpi)；各个屏幕密度之间的关系如下：
密度名称
密度的参考值(dpi)
关系
对应的屏幕分辨率 xxxhdpi
640dpi
xxhdpi
480d...
分类：
移动开发 时间：
2015-06-02 20:16:31
阅读次数：
150
# What is the difference between utm_source, utm_campaign and utm_medium? ## utm_source: As the name suggests this custom variable allows marketers to track the source that is sending the visits. I...
分类：
其他好文 时间：
2015-05-31 17:01:28
阅读次数：
120
1 Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nod...
分类：
编程语言 时间：
2015-05-31 09:33:34
阅读次数：
239
1 Remove Duplicates from Sorted Array II
Follow up for “Remove Duplicates”:What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],
Your function should retu...
分类：
编程语言 时间：
2015-05-29 12:02:04
阅读次数：
123
1 Subsets
Given a set of distinct integers, nums, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For...
分类：
编程语言 时间：
2015-05-28 12:42:36
阅读次数：
125
1 Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use th...
分类：
编程语言 时间：
2015-05-26 10:46:21
阅读次数：
177
Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
因为没有额外的空间，我们可以采用第一个0元素所在的行和列来保存0元素的信息。void setZeroes(vector<vector>& matrix) {...
分类：
编程语言 时间：
2015-05-25 13:08:36
阅读次数：
155
1 Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.
因为这里都是整数，可以直接采用二分法求解int mySqrt(int x) {
if (x <= 1) return x;
int begin = 1, end =x, mid = 0;
while (begin...
分类：
编程语言 时间：
2015-05-24 13:00:28
阅读次数：
173
1 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 t...
分类：
编程语言 时间：
2015-05-23 11:32:57
阅读次数：
234
