- 博客(50)
- 资源 (128)
- 收藏
- 关注
原创 Time Zone: GMT,UTC,DST,CST
全球24个时区的划分 相较于两地时间表,显示世界各时区时间和地名的世界时区表(Universal World Time),就显得精密与复杂多,通常世界时区表的表盘上会标示着全球24个时区的城市名称。全球24个时区是如何产生的? 过去世界各地原本各自制订当地时间,但随着交通和电讯的发达,各地交流日益频繁,不同的地方时间造成许多困扰,于是在西元1884年的国际会议上制定了全球性
2013-04-30 22:06:07 13258
转载 谷歌帮:中国最牛的创业帮派
【导读】随着郭去疾的兰亭集势提交IPO申请,谷歌背景的创业者也逐渐浮出水面:创新工场创始人李开复、小米联合创始人林斌、友盟创始人蒋凡、木瓜移动创始人沈思、聚美优品联合创始人戴雨森、涂鸦移动创始人王晔……据统计,谷歌中国至少贡献了20个互联网公司的创始人或CEO,而其中不乏数亿美金甚至数十亿美金公司的缔造者。由此,谷歌中国也一度被人誉为中国互联网界的“黄埔军校”。创新工场创始人——李开复1、“创业导
2013-04-26 00:00:52 11960 6
原创 Cloud Computing: IaaS PaaS SaaS
云服务(Cloud Computing),是一种基于互联网的计算方式,通过这种方式共享的软硬件资源和信息可以按需提供给计算机和其他设备。“云”,其实是互联网的一个隐喻,“云计算”其实就是使用互联网来接入存储或者运行在远程服务器端的应用,数据,或者服务。任何一个在互联网上提供其服务的公司都可以叫做云计算公司。其实云计算分几层的,分别是: 1) Infrastructure-as-a-Serv
2013-04-22 22:12:30 4275
原创 【leetcode】Valid Number
Question : Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous. You s
2013-04-21 23:50:28 4820 1
原创 【leetcode】Word Ladder II
Question : Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate word m
2013-04-21 23:04:41 4941
原创 【leetcode】Word Ladder
Question :Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate
2013-04-21 21:57:11 3131
原创 【leetcode】Best Time to Buy and Sell Stock III
Question : Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You may
2013-04-21 21:18:20 2872
原创 【leetcode】Best Time to Buy and Sell Stock II
Quesion : Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie,
2013-04-21 20:46:33 2835
原创 【leetcode】Best Time to Buy and Sell Stock
Question : Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of t
2013-04-21 19:39:02 3410
原创 【leetcode】Integer to Roman
Question : Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Anwser 1 : class Solution {public: string intToRoman(int num) { //
2013-04-21 18:41:14 3708
原创 【leetcode】Roman to Integer
Question :Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Anwser 1 : class Solution {public: int toNum(char c) { sw
2013-04-21 10:40:29 3300
原创 【leetcode】Reverse Integer
Question : Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for you
2013-04-21 08:46:56 3724
原创 【leetcode】Divide Two Integers
Question : Divide two integers without using multiplication, division and mod operator.Anwser 1 : class Solution {public: int divide(int dividend, int divisor) { // Start typing your
2013-04-20 10:21:37 4439
原创 【leetcode】Binary Tree Zigzag Level Order Traversal
Question :Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given bin
2013-04-20 09:31:19 2646
原创 【leetcode】Zigzag Conversion
Question : The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P
2013-04-20 00:58:32 3003
原创 【leetcode】String to Integer (atoi)
Question :Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible in
2013-04-19 23:30:13 7092 2
原创 【leetcode】Binary Tree Level Order Traversal
Question :Given 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 {3,9,20,#,#,15,7}, 3 / \ 9 20
2013-04-19 22:42:40 2793
原创 【leetcode】Maximum Depth of Binary Tree
Question :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.Anwser 1 : DFS/** * Definition
2013-04-19 21:36:02 6679
原创 【leetcode】Surrounded Regions
Question :Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region .For example,X X X XX O O XX X
2013-04-14 15:54:45 4089 3
原创 【leetcode】Palindrome Partitioning II
Question : Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = "aab",Retur
2013-04-14 14:47:08 3094
原创 【leetcode】Palindrome Partitioning
Question:Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","b"]
2013-04-14 13:48:52 2752
原创 【leetcode】Palindrome Number
Question:Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, n
2013-04-14 12:14:06 6412 2
原创 【leetcode】Valid Palindrome
Question: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 car" is not a
2013-04-14 11:31:01 3398
原创 【leetcode】Implement strStr()
Question:Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.Anwser 1: O(n*m)class Solution {public: char *strStr(char *
2013-04-14 10:53:37 2818
原创 【leetcode】Rotate List
Question:Given 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,return 4->5->1->2->3->NULL.Anwser 1: merge a circle /** * Defi
2013-04-14 09:51:20 2472 1
原创 【leetcode】Triangle
Question: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],
2013-04-14 01:10:18 2457 1
原创 【leetcode】Pascal's Triangle II
Question:Given 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 to use only O(k) extra space?Anwser 1: class S
2013-04-14 00:20:16 2606
原创 【leetcode】Pascal's Triangle
Question: Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]Anwser 1: class So
2013-04-13 23:31:58 2564
原创 【leetcode】Populating Next Right Pointers in Each Node II
Question:Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant ext
2013-04-13 22:46:08 3087
原创 【leetcode】Populating Next Right Pointers in Each Node
Question :Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node.
2013-04-13 22:19:12 2691 2
原创 【leetcode】Sum Root to Leaf Numbers
Question: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 total
2013-04-13 21:25:02 2190
原创 【leetcode】Path Sum II
Question:Given 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, 5 / \
2013-04-13 12:09:36 2709 5
原创 【leetcode】Path Sum
Question:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and
2013-04-13 11:36:24 2369
原创 【leetcode】N-Queens II
Question: Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Anwser 1: O(n^3) based-on Rowclass Solution {public: bool ch
2013-04-13 11:09:29 2758
原创 【leetcode】N-Queens
Question: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.
2013-04-13 10:22:18 2559
原创 【leetcode】Add Two Numbers
Question:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it
2013-04-13 09:22:43 3408
原创 【leetcode】Add Binary
Question:Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".Anwser 1: class Solution {public: string addBinary(string a, string b) {
2013-04-13 01:41:16 4237
原创 【leetcode】3Sum Closest
Question: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 hav
2013-04-13 01:20:58 2805
原创 【leetcode】Plus One
Question:Given a number represented as an array of digits, plus one to the number.Anwser 1: szie -> 0class Solution {public: vector plusOne(vector &digits) { // Start typing your C/C++
2013-04-13 00:49:38 2329
原创 【leetcode】sqrt(int x)
Question:Implement int sqrt(int x).Compute and return the square root of x.Anwser 1: 二分法class Solution {public: int sqrt(int x) { if(x = 0); long long x2 = (lon
2013-04-13 00:01:54 4541
SecureCRT 7.0.2 For Mac 10.12.3 完美破解版
2017-04-04
FatJar打包工具
2014-02-28
Android MotionEvent 坐标获取
2013-04-07
亚马逊(Amazon)称霸电商的秘诀
2013-04-05
Android中visibility属性
2013-04-03
Android与js交互实例
2013-04-01
Google Play 应用内支付(In-app Billing V2 + V3)
2012-12-18
VMware 8安装Mac OS X 10.8 Lion系统及工具包
2012-10-30
VMware 8安装Mac OS X 10.7 Lion
2012-10-18
Android反编译工具包(升级)官方绿色版
2012-10-10
JSP 页面访问用户验证
2012-09-29
Android反编译工具
2012-08-21
Android 创建与解析XML Pull方式
2012-04-30
Android 创建与解析XML Dom方式
2012-04-29
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人