leetcode
文章平均质量分 72
琥珀彩
这个作者很懒,什么都没留下…
展开
-
leetcode 5 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.中文为:寻找一个字符串里原创 2016-04-12 09:42:27 · 315 阅读 · 0 评论 -
leetcode 24. 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 should use only constant原创 2016-06-01 10:00:40 · 265 阅读 · 0 评论 -
leetcode 202. Happy Number
题目:Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of th原创 2016-04-25 09:29:37 · 280 阅读 · 0 评论 -
leetcode 17. Letter Combinations of a Phone Number
1.题目Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:原创 2016-05-09 17:35:21 · 258 阅读 · 0 评论 -
leetcode 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 an原创 2016-06-02 09:15:18 · 295 阅读 · 0 评论 -
leetcode 25. 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.有一个单链表,需要每次反转k个节点,最后返回修改后的链表。If the number of nodes is not a multiple of k then left原创 2016-06-07 15:07:54 · 320 阅读 · 0 评论 -
leetcode 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.给了两个字符串,返回一个短的字符串在另一个长字符串中的起始索引纸。长/短字符串分别有标记,不用自己比较哪个长哪个短。原创 2016-06-08 11:14:17 · 247 阅读 · 0 评论 -
leetcode 36. Valid Sudoku
题目:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.只是判断,当前的数独是否是有效状态而已。。。并不是要解一个数独。The Sudoku board could be partially filled, where empty cells are filled with原创 2016-06-24 20:24:28 · 387 阅读 · 0 评论 -
leetcode 17. 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 telephone buttons) is given below.Input:Digit string原创 2016-05-23 10:28:04 · 292 阅读 · 0 评论 -
leetcode 29. Divide Two Integers
题目:Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 写一个除法算法,但是不许用多项式,除法符号,取模,当溢出时,返回INT_MAX;解答:开始想法,利用不断的减法,减法的次数即为除法的商,但原创 2016-06-12 17:13:05 · 244 阅读 · 0 评论 -
leetcode 30. 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) ins that is a concatenation of each word in words exactly once原创 2016-06-13 20:07:26 · 279 阅读 · 0 评论 -
leetcode 31. Next Permutation
题目:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.根据字典排序的规则,将现有的序列,变为大一个的序列。If such arrangement is not possible, it must re原创 2016-06-14 21:25:36 · 271 阅读 · 0 评论 -
leetcode 32. 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 parentheses substring is原创 2016-06-15 11:09:00 · 344 阅读 · 0 评论 -
leetcode 33.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 可能在某个支点被事先循环了,那么这个数组可能变成了4 5 6 7 0 1 2现在,针对这个事先循环操作过的数组4 5 6 7 0 1 2进行搜索原创 2016-06-16 17:03:17 · 311 阅读 · 0 评论 -
leetcode 34. 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 fou原创 2016-06-20 16:05:56 · 256 阅读 · 0 评论 -
leetcode 35. 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 arr原创 2016-06-20 16:26:53 · 262 阅读 · 0 评论 -
两个字符串的编辑距离-动态规划方法
概念字符串的编辑距离,又称为Levenshtein距离,由俄罗斯的数学家Vladimir Levenshtein在1965年提出。是指利用字符操作,把字符串A转换成字符串B所需要的最少操作数。其中,字符操作包括:删除一个字符 a) Insert a character插入一个字符 b) Delete a character修改一个原创 2016-10-11 11:51:42 · 30772 阅读 · 20 评论 -
leetcode 16. 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 input would have exa原创 2016-05-19 09:46:38 · 258 阅读 · 0 评论 -
背包问题-堆栈-找出其中一组解(总体积为T,n件物品体积分别是w1,w2,...,w2n,找出若干件恰好装满背包)
问题描述:总体积为T的背包,n件物品体积分别是w1,w2,...,wn,找出若干件恰好装满背包。找出满足条件的解。例如,当T=10时,各件物品的体积时{1,8,4,3,5,2}时,可找到下列4组解:(1,4,3,2),(8,2),(1,4,5),(3,5,2)。提示:(1)将物品顺序选取到背包中。假设选取了钱i件物品之后背包还没有装满,则继续选取第i+1件物品。(2)若改件原创 2016-04-23 17:18:23 · 7848 阅读 · 3 评论 -
leetcode 232. Implement Queue using Stacks
Implement the following operations of a queue using stacks.利用堆栈完成下列队列操作push(x) -- Push element x to the back of queue.将元素放入队列最末尾pop() -- Removes the element from in front of queue.移除队列首部的元素pee原创 2016-05-18 16:50:13 · 366 阅读 · 0 评论 -
14. Longest Common Prefix
题目:Write a function to find the longest common prefix string amongst an array of strings.写一个函数找到多个字符串中最长前缀。描述方法:假设字符串数组为 { "12345" , "1246" , "1248"},最长前缀为 “12”。字符串数组声明 char * str[]=原创 2016-04-26 10:52:27 · 332 阅读 · 0 评论 -
leetcode 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,原创 2016-04-27 09:41:47 · 269 阅读 · 0 评论 -
leetcode 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.给一个整数翻译为罗马数字。方法一:将个十百千每位的数字取出来,利用switch的每位0-9的十个分支,得到相应的罗马字符好理解,代码长c原创 2016-04-28 11:16:04 · 270 阅读 · 0 评论 -
345. Reverse Vowels of a String
题目:Write a function that takes a string as input and reverse only the vowels of a string.Example 1:Given s = "hello", return "holle". Example 2:Given s = "leetcode", return "leotcede".原创 2016-05-10 20:45:03 · 428 阅读 · 0 评论 -
leetcode 283. Move Zeroes
题目:Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after ca原创 2016-04-29 09:17:09 · 262 阅读 · 0 评论 -
leetcode 18. 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:Elements原创 2016-05-24 18:06:33 · 221 阅读 · 0 评论 -
136. Single Number
题目Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using e原创 2016-05-12 10:40:26 · 216 阅读 · 0 评论 -
leetcode 19. 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 removing the second node from the end,原创 2016-05-25 16:03:12 · 279 阅读 · 0 评论 -
leetcode 8 atoi
题目:8. String to Integer (atoi)Implement atoi to convert a string t原创 2016-04-18 09:50:43 · 323 阅读 · 0 评论 -
leetcode 20. 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, "()" and "()[]{}" are al原创 2016-05-26 09:18:10 · 215 阅读 · 0 评论 -
leetcode 9 给一个int类型的数字,判断是否是回文数
leetcode 9 给一个int类型的数字,判断是否是回文数题目要求:Determine whether an integer is a palindrome. Do this without extra space.Could negative integers be palindromes? (ie, -1) 负数返回falseIf you are thinki原创 2016-04-19 09:09:05 · 813 阅读 · 0 评论 -
leetcode 21. 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.合并两个已经排好序的链。新的链应该是合并两个链。(那么意思是不可以申请新空间)第一次原创 2016-05-27 09:49:13 · 259 阅读 · 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.将罗马数字转译为阿拉伯数字。思路:基本字符相应的阿拉伯数字: I(1)、V(5)、X(10)、L(50)、C(100)、D(500)、M(10原创 2016-04-21 10:32:50 · 321 阅读 · 0 评论 -
leetcode 15. 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.提供一个包含了n个int型数据的数组,判断是否里面存在这样的三个数a b c,原创 2016-05-17 09:10:30 · 295 阅读 · 0 评论 -
leetcode 22. Generate Parentheses
题目:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.n:n对儿括号,写一个函数,生成所有括号的组合方式For example, given n = 3, a solution set is:"((()))原创 2016-05-30 09:54:54 · 264 阅读 · 0 评论 -
leetcode 23. Merge k Sorted Lists
题目:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.合并k个排好序的的链,并且返回一个有序链。方法一:想到21题是合并两个排好序的链,那么这个题可以借鉴思想。每次从数组中取两个链表,将合并结果加入到链表中,反复原创 2016-05-31 11:01:03 · 332 阅读 · 0 评论 -
Leetcode 1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same el...原创 2018-04-05 13:58:36 · 193 阅读 · 0 评论