阳光岛主

欢迎访问我的新博客: https://blog.mimvp.com

Time Zone: GMT,UTC,DST,CST

全球24个时区的划分       相较于两地时间表,显示世界各时区时间和地名的世界时区表(Universal World Time),就显得精密与复杂多,通常世界时区表的表盘上会标示着全球24个时区的城市名称。全球24个时区是如何产生的?       过去世界各地原本各自制订当地时间,但随着交通和...

2013-04-30 22:06:07

阅读数:8072

评论数:0

谷歌帮:中国最牛的创业帮派

【导读】随着郭去疾的兰亭集势提交IPO申请,谷歌背景的创业者也逐渐浮出水面:创新工场创始人李开复、小米联合创始人林斌、友盟创始人蒋凡、木瓜移动创始人沈思、聚美优品联合创始人戴雨森、涂鸦移动创始人王晔……据统计,谷歌中国至少贡献了20个互联网公司的创始人或CEO,而其中不乏数亿美金甚至数十亿美金公司...

2013-04-26 00:00:52

阅读数:9870

评论数:6

Cloud Computing: IaaS PaaS SaaS

云服务(Cloud Computing),是一种基于互联网的计算方式,通过这种方式共享的软硬件资源和信息可以按需提供给计算机和其他设备。“云”,其实是互联网的一个隐喻,“云计算”其实就是使用互联网来接入存储或者运行在远程服务器端的应用,数据,或者服务。任何一个在互联网上提供其服务的公司都可以叫做云...

2013-04-22 22:12:30

阅读数:3619

评论数:0

【leetcode】Valid Number

Question : Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1...

2013-04-21 23:50:28

阅读数:4377

评论数: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 lett...

2013-04-21 23:04:41

阅读数:4604

评论数:0

【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 on...

2013-04-21 21:57:11

阅读数:2776

评论数:0

【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...

2013-04-21 21:18:20

阅读数:2652

评论数:0

【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 ...

2013-04-21 20:46:33

阅读数:2596

评论数:0

【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 o...

2013-04-21 19:39:02

阅读数:3145

评论数:0

【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 { p...

2013-04-21 18:41:14

阅读数:3311

评论数:0

【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 {...

2013-04-21 10:40:29

阅读数:2991

评论数:0

【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 qu...

2013-04-21 08:46:56

阅读数:3423

评论数:0

【leetcode】Divide Two Integers

Question : Divide two integers without using multiplication, division and mod operator.Anwser 1 :      class Solution { public: int divide(int di...

2013-04-20 10:21:37

阅读数:4052

评论数:0

【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...

2013-04-20 09:31:19

阅读数:2258

评论数:0

【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 pa...

2013-04-20 00:58:32

阅读数:2496

评论数:0

【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 ...

2013-04-19 23:30:13

阅读数:6693

评论数: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 bina...

2013-04-19 22:42:40

阅读数:2527

评论数:0

【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 ...

2013-04-19 21:36:02

阅读数:6190

评论数:0

【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 ...

2013-04-14 15:54:45

阅读数:3717

评论数: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 p...

2013-04-14 14:47:08

阅读数:2794

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭