LeetCode学习之路
文章平均质量分 87
Supersky
这个作者很懒,什么都没留下…
展开
-
Reverse Words in a String
笔者近来开始在LeetCode上学习常用的算法设计,原创 2014-09-06 16:07:07 · 594 阅读 · 0 评论 -
Leecode-Pow(x,n)
题目原文要求(摘抄自LeetCode):Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Clarification:What constitutes a word?A原创 2014-09-06 17:20:36 · 744 阅读 · 0 评论 -
LeetCode- Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in the array, return [-1, -1].原创 2014-09-11 17:10:39 · 508 阅读 · 0 评论 -
Leetcode- Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array。原创 2014-09-11 14:37:18 · 601 阅读 · 0 评论 -
Leetcode-Restore IP Addresses
题目原文要求(摘抄自LeetCode):Implement pow(x, n).题目解析: 今天的题目比较简单,就是自己动手写一个乘方函数pow(x,n)。题目虽然简单,但是一次考虑全面还真的不是那么容易,你需要考虑很多临界条件。我的解题思路: 记得同学第一次问我这个题目的时候,我就说:这个题目很简单,直接一个for循环就可以搞定了。我同学就鄙夷的笑了起来:你给我实现原创 2014-09-11 11:21:29 · 562 阅读 · 0 评论