LeetCode OJ刷题日记
文章平均质量分 54
LLL_mj
这个作者很懒,什么都没留下…
展开
-
LeetCode OJ 26 Remove Duplicates from Sorted Array
毕设做累了,无聊刷个题压压惊。今天是第一次做leetcode的题目,做题顺序按照分类来做。该题分类为线性表,题目难度为简单。Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not原创 2015-05-25 14:30:42 · 620 阅读 · 0 评论 -
LeetCode OJ 12 Integer to Roman
题目:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.难度: medium思路:找到罗马数字对应阿拉伯数字的规律即可。将数字对应序列从大到小排列,每次减掉可以减掉的最大数,换成对应的罗马字母即可原创 2015-10-21 06:35:18 · 546 阅读 · 0 评论 -
LeetCode OJ 13 Roman To Integer
参考http://blog.csdn.net/jellyyin/article/details/13165731代码如下class Solution {public: int romanToInt(string s) { map mapValue; mapValue.insert(pair('I',1)); mapValue.inser转载 2015-10-21 07:13:10 · 402 阅读 · 0 评论 -
LeetCode OJ 123 Best Time to Buy and Sell Stock III
题目: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 k transactions.Note:Y转载 2015-10-21 01:07:43 · 471 阅读 · 0 评论 -
LeetCode OJ 9 Palindrome Number
题目:Determine whether an integer is a palindrome. Do this without extra space.难度easy思路:每一个提取最高位和最低位进行比较即可代码如下using namespace std;class Solution {public: bool isPalindrome(int x) {原创 2015-10-21 01:28:06 · 429 阅读 · 0 评论 -
LeetCode OJ 11 Container With Most Water
题目:Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,原创 2015-10-21 06:16:45 · 437 阅读 · 0 评论 -
LeetCode OJ 01 Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe转载 2015-09-24 00:26:26 · 346 阅读 · 0 评论 -
LeetCode OJ 02 Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link转载 2015-09-24 00:54:08 · 401 阅读 · 0 评论 -
LeetCode OJ 03 Longest Substring Without Repeating Characters
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3.转载 2015-09-24 03:45:28 · 355 阅读 · 0 评论 -
LeetCode OJ 14 Longest Common Prefix
题目:Write a function to find the longest common prefix string amongst an array of strings.难度:Easy思路: 从头开始比较每个字符串,不等就停止循环即可代码如下class Solution {public: string longestCommonPrefix(vecto原创 2015-10-21 07:26:02 · 403 阅读 · 0 评论 -
LeetCode OJ 121 Best Time to Buy and Sell Stock
题目: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 th原创 2015-10-19 12:33:20 · 423 阅读 · 0 评论 -
LeetCode OJ 81 Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the原创 2015-07-11 11:24:48 · 482 阅读 · 0 评论 -
LeetCode OJ 80 Remove Duplicates from Sorted ArrayII
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi原创 2015-07-05 17:55:53 · 575 阅读 · 0 评论 -
LeetCode OJ 4 Median of Two Sorted Arrays
难度:hardThere are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).思路参考:http:转载 2015-07-12 19:42:06 · 470 阅读 · 0 评论 -
LeetCode OJ 33 Search in Rotated Sorted Array
难度:hard由此可见leetcode的hard难度比较于acm是偏简单一些的。Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a tar原创 2015-07-06 18:21:08 · 569 阅读 · 0 评论 -
LeetCode OJ 0 Reverse Integer
题目难度:easyReverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321思路:题目本身很简单,但是需要考虑到超出int类型的情况,网上有一些accept的code在本机测试的时候其实是错的,也不知道为什么online judge就过了。原创 2015-08-27 12:33:28 · 421 阅读 · 0 评论 -
LeetCode OJ 06 ZigZag Conversions
题目难度:easyThe 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原创 2015-08-27 08:13:42 · 515 阅读 · 0 评论 -
LeetCode OJ 198 House Robber
题目:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjac原创 2015-10-18 00:32:35 · 482 阅读 · 0 评论 -
LeetCode OJ 123 Best Time to Buy and Sell Stock III
题目: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:原创 2015-10-20 01:13:02 · 489 阅读 · 0 评论 -
LeetCode OJ 05 Longest Palindromic Substring
题目:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.难度:medium原创 2015-10-13 23:42:17 · 419 阅读 · 0 评论