leetcode oj题目:Best Time to Buy and Sell Stock; Say you have an array for which the i-th 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 the stock), design an algorithm to find the maximum profit.

leetcode oj题目:Best Time to Buy and Sell Stock II;Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

leetcode oj题目:Linked List Cycle; Given a linked list, determine if it has a cycle in it.

leetcode oj题目:Same Tree; Given two binary trees, write a function to check if they are equal or not.

leetcode oj题目:Maximum Depth of Binary Tree; Given a binary tree, find its maximum depth.

leetcode oj题目:Climbing Stairs; You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

leetcode oj题目:Single Number;Given an array of integers, every element appears twice except for one. Find that single one.

利用github和jekyll搭建一个个人博客，github托管，git方式管理。

测试一下分类功能和发布blog功能。测试一下分类功能和发布blog功能。