leetcode
文章平均质量分 72
萌萌哒北极熊
这个作者很懒,什么都没留下…
展开
-
26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with c原创 2017-05-18 23:48:34 · 145 阅读 · 0 评论 -
leetcode 13. Roman to Integer
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. Subscribe to see which companies asked this question. 看到这个题首先百度了一下罗马数字:原创 2017-04-25 23:54:44 · 134 阅读 · 0 评论 -
leetcode 7.Reverse Integer
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Note: The input is assumed to be a 32-bit signed integer. Your function should原创 2017-04-22 00:25:55 · 165 阅读 · 0 评论 -
leetcode Two Sum
题目链接:https://leetcode.com/problems/two-sum/#/description 参考他人资料的链接:http://www.cnblogs.com/springfor/p/3859618.html http://www.jiuzhang.com/solutions/two-sum/原创 2017-04-17 23:39:22 · 192 阅读 · 0 评论 -
27. Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. The原创 2017-05-19 16:24:50 · 148 阅读 · 0 评论 -
28. Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 题目主要意思是在一个大的字符串中查找是否有一部分与小的字符串相同,返回第一次相同时的首字母下标,例如,大的字符串haystack = “原创 2017-05-19 16:56:55 · 161 阅读 · 0 评论