2014年7月26日
LeetCode:Best Time to Buy and Sell Stock
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-07-26 11:46 LeviCode 阅读(141) 评论(0) 推荐(0) 编辑
LeetCode:Reverse Integer
摘要： Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321 1 class Solution { 2 public: 3 int reverse(int x){ 4 ... 阅读全文
posted @ 2014-07-26 09:37 LeviCode 阅读(99) 评论(0) 推荐(0) 编辑
2014年7月21日
LeetCode:Same Tree
摘要： Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文
posted @ 2014-07-21 11:49 LeviCode 阅读(112) 评论(0) 推荐(0) 编辑
LeetCode:Single Number II
摘要： Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp... 阅读全文
posted @ 2014-07-21 11:33 LeviCode 阅读(100) 评论(0) 推荐(0) 编辑
2014年7月20日
LeetCode:Single Number
摘要： Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity... 阅读全文
posted @ 2014-07-20 18:22 LeviCode 阅读(96) 评论(0) 推荐(0) 编辑
LeetCode:Minimum Depth of Binary Tree
摘要： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2014-07-20 16:09 LeviCode 阅读(90) 评论(0) 推荐(0) 编辑
LeetCode:Maximum Depth of Binary Tree
摘要： 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 le... 阅读全文
posted @ 2014-07-20 16:08 LeviCode 阅读(88) 评论(0) 推荐(0) 编辑
LeetCode:Remove Duplicates from Sorted List
摘要： Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2014-07-20 16:05 LeviCode 阅读(87) 评论(0) 推荐(0) 编辑
LeetCode:Plus One
摘要： Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2014-07-20 16:03 LeviCode 阅读(130) 评论(0) 推荐(0) 编辑
2014年7月19日
LeetCode:Length of Last Word
摘要： Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe... 阅读全文
posted @ 2014-07-19 16:11 LeviCode 阅读(93) 评论(0) 推荐(0) 编辑