leecode
夏天的技术博客
这个作者很懒,什么都没留下…
展开
-
leetcode 2 -- Add Two Numbers
leetcode 2 – 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 t原创 2015-05-20 16:04:44 · 926 阅读 · 0 评论 -
leetcode 35 -- Search Insert Position
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 as原创 2015-06-24 00:44:46 · 1612 阅读 · 0 评论 -
leetcode 19 -- Remove Nth Node From End of List
Remove Nth Node From End of List 题目: Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After r原创 2015-06-05 12:14:37 · 996 阅读 · 0 评论 -
leetcode 22 -- Generate Parentheses
Generate Parentheses 题目: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: “((()))”, “(()(原创 2015-06-06 23:23:08 · 1591 阅读 · 0 评论 -
leetcode23 -- Merge k Sorted Lists
Merge k Sorted Lists 题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 题意: 合并k个已经排序过的链表。 思路:原创 2015-06-07 12:13:54 · 814 阅读 · 0 评论 -
leetcode 24 -- Swap Nodes in Pairs
Swap Nodes in Pairs 题目: Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm sh原创 2015-06-08 10:29:19 · 994 阅读 · 0 评论 -
leetcode 5 -- Longest Palindromic Substring
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 palindrom原创 2015-05-24 11:07:36 · 795 阅读 · 0 评论 -
leetcode 25 -- Reverse Nodes in k-Group
Reverse Nodes in k-Group 题目: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes原创 2015-06-10 17:06:51 · 1183 阅读 · 0 评论 -
leetcode 26 -- Remove Duplicates from Sorted Array
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原创 2015-06-10 17:32:59 · 1027 阅读 · 0 评论 -
leetcode 27 -- Remove Element
Remove Element 题目: Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyo原创 2015-06-11 12:17:56 · 1146 阅读 · 0 评论 -
leetcode 28 -- Implement strStr()
Implement strStr() 题目: mplement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Update (2014-11-02): The signature of原创 2015-06-11 12:23:14 · 916 阅读 · 0 评论 -
leetcode 4 -- Median of Two Sorted Arrays
Median of Two Sorted Arrays 题目: There 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 (原创 2015-05-22 22:55:20 · 816 阅读 · 0 评论 -
leetcode 6 -- ZigZag Conversion
ZigZag Conversion 题目: The 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)原创 2015-05-25 13:05:50 · 938 阅读 · 0 评论 -
leetcode 29 -- Divide Two Integers
Divide Two Integers 感想: >这道题因为有一点小问题一直导致AC不过,一会我会先贴上自己的正确代码,之前错误的贴到后面。>在一直解决不了遇到的问题时,我去网上搜了下别人做这道题的思路,感觉自己的思路也算比较简单吧,就一直坚持自己的思路,依然不知道哪里错了,调试于是查了查abs函数,发现了还有其他的类abs函数,自己没用过,labs和llabs,于是发现了自己边界的问题,改正加上了一个原创 2015-06-12 17:23:05 · 2916 阅读 · 0 评论 -
leetcode 30 -- Substring with Concatenation of All Words
Substring with Concatenation of All Words 题目: You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a conc原创 2015-06-14 00:57:56 · 940 阅读 · 0 评论 -
leetcode 31 -- Next Permutation
Next Permutation 题目: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearran原创 2015-06-15 18:52:33 · 1017 阅读 · 0 评论 -
leetcode 21 -- Merge Two Sorted Lists
Merge Two Sorted Lists 题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 题意: 合并两个排序过的链表 思路:原创 2015-06-05 12:25:18 · 823 阅读 · 0 评论 -
leetcode 20 -- Valid Parentheses
Valid Parentheses 题目: Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()”原创 2015-06-05 12:20:10 · 886 阅读 · 0 评论 -
leetcode 18 -- 4Sum
4Sum 题目:Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note: El原创 2015-06-04 15:12:14 · 1421 阅读 · 2 评论 -
leetcode 1 -- Two Sum
leetcode 1 – Two Sum 最近打算开始练习下leetcode上面的题,原因有2点 - 1.保证自己每天有敲一定的代码练习,避免手生。 - 2.锻炼自己的思维能力吧,思维还是很重要的。 题目: Given an array of integers, find two numbers such that they add up to a specific t原创 2015-05-20 15:29:17 · 992 阅读 · 0 评论 -
leetcode 7 -- Reverse Integer
Reverse Integer 题目: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 题意: 给你一个整型数,要求返回它的反转数,题目说的很清楚了,但是需要注意的一点就是整型溢出的情况,如果溢出我们返回0。 思路: 我偷懒了用原创 2015-05-26 17:13:03 · 913 阅读 · 0 评论 -
leetcode 9 -- Palindrome Number
Palindrome Number 题目: Determine whether an integer is a palindrome. Do this without extra space. 题意: 判断一个整数是否是回文的,要求不使用额外的空间 思路: 简单起见我用的python,先判断是否为0,或者负数,若不是则转化为字符串,然后利用切片截取两段,反转其中一个比较是原创 2015-05-27 23:43:07 · 765 阅读 · 0 评论 -
leetcode 3 -- Longest Substring Without Repeating Characters
leetcode 3 – Longest Substring Without Repeating Characters 题目: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without r原创 2015-05-21 16:46:19 · 1197 阅读 · 3 评论 -
leetcode 8 -- String to Integer (atoi)
String to Integer (atoi) 题目: Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourse原创 2015-05-27 14:52:32 · 930 阅读 · 0 评论 -
leetcode 10 -- Regular Expression Matching
Regular Expression Matching 题目: Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. Th原创 2015-05-28 20:48:07 · 1085 阅读 · 0 评论 -
leetcode 32 -- Longest Valid Parentheses
Longest Valid Parentheses 题目: Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. For “(()”, the longest valid p原创 2015-06-18 13:23:58 · 992 阅读 · 0 评论 -
leetcode 13 -- Roman to Integer
Roman to Integer 题目: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 题意: 把罗马数字转化为阿拉伯数字 思路: 需要先了解转化规则,可看上一篇博客,首先建立字典,轮寻字符串,加上原创 2015-05-30 17:37:41 · 644 阅读 · 0 评论 -
leetcode 14 -- Longest Common Prefix
Longest Common Prefix 题目: Write a function to find the longest common prefix string amongst an array of strings. 题意: 找出所有字符串的最长的公共前缀 思路:先找到最短的一个字符串,然后它的长度当作范围,接着判断所有字符串的同一个下标的字符,若全部相等则添加到返回字符原创 2015-05-31 12:47:24 · 978 阅读 · 0 评论 -
leetcode 12 -- Integer to Roman
Integer to Roman 题目: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 题意: 给于一个整型数字范围在1-3999,将它转化为罗马数字 思路: 将罗马数字用键-值标识出来,转换即可。原创 2015-05-30 13:19:55 · 859 阅读 · 0 评论 -
leetcode 15 -- 3Sum
3Sum 题目: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. For example, given array S原创 2015-06-01 14:06:32 · 870 阅读 · 0 评论 -
leetcode 16 -- 3Sum Closest
3Sum Closest 题目: Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each in原创 2015-06-02 18:48:20 · 899 阅读 · 0 评论 -
leetcode 33 -- Search in Rotated Sorted Array
Search in Rotated Sorted Array 题目: 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 target value原创 2015-06-22 13:04:46 · 2550 阅读 · 2 评论 -
leetcode 34 -- Search for a Range
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).原创 2015-06-23 00:36:45 · 1541 阅读 · 0 评论 -
leetcode 17 -- Letter Combinations of a Phone Number
Letter Combinations of a Phone Number 题目: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho原创 2015-06-03 10:52:00 · 919 阅读 · 0 评论 -
实现一个 O(1) 查找的 LRU Cache
前几天百度面试,当时让实现一个 LRU Cache,要求 O(1) 完成查找。后来发现这个也可以用在自己简易的 key-value 数据库项目中。简单来说 LRU 是内存管理的一种算法,淘汰最近不用的页。O(1) 时间完成查找,那除了 hash 别无选择。LRU 用双向链表实现即可。数据结构选择好了,查找我们用 hash 通过 key 得到链表节点的位置,然后更新 LRU 链表即可。简单说下自己的项原创 2016-09-01 19:13:19 · 3032 阅读 · 1 评论