Time Zone: GMT,UTC,DST,CST

全球24个时区的划分       相较于两地时间表,显示世界各时区时间和地名的世界时区表(Universal World Time),就显得精密与复杂多,通常世界时区表的表盘上会标示着全球24个时区的城市名称。全球24个时区是如何产生的?       过去世界各地原本各自制订当地时间,但随着交通和电讯的发达,各地交流日益频繁,不同的地方时间造成许多困扰,于是在西元1884年的国际会议上制定了全球性...
阅读(6776) 评论(0)

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

【导读】随着郭去疾的兰亭集势提交IPO申请,谷歌背景的创业者也逐渐浮出水面:创新工场创始人李开复、小米联合创始人林斌、友盟创始人蒋凡、木瓜移动创始人沈思、聚美优品联合创始人戴雨森、涂鸦移动创始人王晔……据统计,谷歌中国至少贡献了20个互联网公司的创始人或CEO,而其中不乏数亿美金甚至数十亿美金公司的缔造者。由此,谷歌中国也一度被人誉为中国互联网界的“黄埔军校”。创新工场创始人——李开复1、“创业导...
阅读(9394) 评论(6)

Cloud Computing: IaaS PaaS SaaS

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

【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...
阅读(4209) 评论(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...
阅读(4362) 评论(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 one letter can be changed at a timeEach intermediate...
阅读(2628) 评论(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 may complete at most two transactions.Note:You may...
阅读(2534) 评论(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 may complete as many transactions as you like (ie,...
阅读(2466) 评论(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 one transaction (ie, buy one and sell one share of t...
阅读(2958) 评论(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 { public: string intToRoman(int num) { //...
阅读(3165) 评论(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 { public: int toNum(char c) { sw...
阅读(2860) 评论(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 questions to ask before coding. Bonus points for you...
阅读(3255) 评论(0)

【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...
阅读(3935) 评论(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 level and alternate between).For example:Given bin...
阅读(2153) 评论(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 pattern in a fixed font for better legibility)P A H N A P...
阅读(2369) 评论(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 see below and ask yourself what are the possible in...
阅读(6382) 评论(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...
阅读(2404) 评论(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 farthest leaf node.Anwser 1 :  DFS/** * Definition...
阅读(5844) 评论(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 surrounded region .For example,X X X X X O O X X X...
阅读(3577) 评论(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...
阅读(2682) 评论(0)
50条 共3页1 2 3 下一页 尾页
    个人资料
    • 访问:11687956次
    • 积分:88672
    • 等级:
    • 排名:第15名
    • 原创:708篇
    • 转载:169篇
    • 译文:16篇
    • 评论:3047条
    学习经历
    中科院、百度、创新工场、小米、阿里巴巴、米扑科技

    期货从业资格证(2017.03)
    基金从业资格证(2016.11)
    证券投资顾问证(2016.9)
    证券从业资格证(2016.6)
    系统架构设计师(2013)
    软件设计师(2008)
    CSDN创业专访

    程序员创业邦
    QQ群: 239292073
    青春,每一个有梦想的人

    资深产品经理人
    QQ群: 338142405
    思与行,人人都是产品经理

    爱脚本,爱技术
    QQ群: 320296250
    (已满)
    python、ruby、php、go、shell

    程序人生的平凡生活
    QQ群: 282297696
    (已满)
    汇聚百度、小米、微软、腾讯、
    创新工场、阿里巴巴、日本雅虎
    个人博客
    博客专栏
    博客公告
    本博客内容,由本人精心整理
    欢迎交流,欢迎转载,大家转载注明出处,禁止用于商业目的。

    文章分类