LeetCode算法分析
LeetCode算法学习,我们踏踏实实走向一线互联网
优惠券已抵扣
余额抵扣
还需支付
¥9.90
¥99.00
购买须知?
本专栏为图文内容,最终完结不会低于15篇文章。
订阅专栏,享有专栏所有文章阅读权限。
本专栏为虚拟商品,基于网络商品和虚拟商品的性质和特征,专栏一经购买无正当理由不予退款,不支持升级,敬请谅解。
杜鲁门
keep moving
展开
-
[LeetCode]--401. Binary Watch(递归有点懵)
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).Each LED represents a zero or one, with the least significant bit on the原创 2016-10-17 17:47:04 · 823 阅读 · 0 评论 -
[LeetCode]--404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.我们递归原创 2016-10-17 22:37:24 · 713 阅读 · 0 评论 -
[LeetCode]--405. Convert a Number to Hexadecimal
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase. The hexadecimal str原创 2016-10-18 09:17:52 · 733 阅读 · 0 评论 -
[LeetCode]--409. Longest Palindrome
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example “Aa” is not consider原创 2016-10-18 10:35:52 · 973 阅读 · 0 评论 -
[LeetCode]--412. Fizz Buzz
Write a program that outputs the string representation of numbers from 1 to n.But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For n原创 2016-10-18 13:17:15 · 802 阅读 · 0 评论 -
[LeetCode]--415. Add Strings
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100. Both num1 and num2 contains only digits 0-9. Both原创 2016-10-18 15:02:33 · 733 阅读 · 0 评论 -
[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-10-18 20:17:37 · 641 阅读 · 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, 0). Find two lin原创 2016-10-23 10:37:19 · 445 阅读 · 0 评论 -
[LeetCode]--12. Integer to Roman
[LeetCode]–13. Roman to Integer可以在上面的链接看一下罗马数字的排列规律。然后利用规律,构建数组,把基本的构建数放在数组里面,然后依次判断加进去就行。public class Solution { public String intToRoman(int num) { String[][] roman = { {原创 2016-10-23 11:26:57 · 487 阅读 · 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.Note: The solution set must not contain duplic原创 2016-10-23 17:34:03 · 537 阅读 · 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 "23"O原创 2016-10-24 21:13:52 · 499 阅读 · 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: The solution set mu原创 2016-10-25 17:13:18 · 316 阅读 · 0 评论 -
[LeetCode]--22. 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:[ "((()))", "(()())", "(())()", "()(())", "(原创 2016-10-27 22:03:31 · 401 阅读 · 0 评论 -
[LeetCode]--29. Divide Two Integers
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.以前我记得做过乘法变加法吧,这个有点像除法变减法,用位运算,二进制嘛,左移一位相当于乘以二。一个有趣的是 Math.abs(-2147483648) 结果还是 -2147483648原创 2016-10-28 10:43:26 · 404 阅读 · 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 rearrange it as the lowest possible orde原创 2016-10-31 15:34:32 · 440 阅读 · 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 found in the ar原创 2016-10-31 16:15:37 · 358 阅读 · 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 array.Here原创 2016-10-31 16:54:03 · 388 阅读 · 0 评论 -
[LeetCode]--39. Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited number of t原创 2016-11-01 13:12:03 · 452 阅读 · 0 评论 -
[LeetCode]--40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.No原创 2016-11-01 22:16:43 · 323 阅读 · 0 评论 -
[LeetCode]--43. Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative. Converting the input string to integer is N原创 2016-11-02 18:29:21 · 351 阅读 · 0 评论 -
[LeetCode]--46. Permutations
Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]][Leet原创 2016-11-02 22:04:56 · 428 阅读 · 0 评论 -
[LeetCode]--47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1]][Le原创 2016-11-03 08:41:47 · 322 阅读 · 0 评论 -
[LeetCode]--48. Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up: Could you do this in-place?本地使得二维矩阵,旋转90角度。通过实际数据分析,通过两个步骤的元素交换可实现目标:按照主对角线,将对称元素交换 按照列,将对原创 2016-11-03 14:39:57 · 340 阅读 · 0 评论 -
[LeetCode]--49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: All inputs will原创 2016-11-03 16:50:24 · 300 阅读 · 0 评论 -
[LeetCode]--50. Pow(x, n)
Implement pow(x, n).其实这个题递归和非递归应该都不难实现,就是边界值的问题。public double myPow(double x, int n) { if (n == 0) return 1.0; double res = 1.0; if (n < 0) { if (x >= 1.原创 2016-11-03 22:06:09 · 298 阅读 · 0 评论 -
[LeetCode]--53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the原创 2016-11-04 11:17:21 · 360 阅读 · 0 评论 -
[LeetCode]--54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You should原创 2016-11-04 17:21:18 · 496 阅读 · 0 评论 -
[LeetCode]--55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are原创 2016-11-04 22:02:54 · 351 阅读 · 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 the squares of i原创 2016-10-10 20:49:05 · 574 阅读 · 0 评论 -
[LeetCode]--203. Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5Credits: Special thanks to @mithmatt for a原创 2016-10-11 00:27:14 · 625 阅读 · 0 评论 -
[LeetCode]--204. Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.Credits: Special thanks to @mithmatt for adding this problem and creating all test cases.public int countPrimes(int n)原创 2016-10-11 09:57:33 · 766 阅读 · 0 评论 -
[LeetCode]--205. Isomorphic Strings(同构字符串)
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with another chara原创 2016-10-11 15:24:47 · 1325 阅读 · 0 评论 -
[LeetCode]--206. Reverse Linked List
Reverse a singly linked list.click to show more hints.Hint: A linked list can be reversed either iteratively or recursively. Could you implement both?贴个递归代码,一次Accept。public ListNode reverseList(ListNo原创 2016-10-11 15:39:54 · 706 阅读 · 0 评论 -
[LeetCode]--217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2016-10-11 16:46:13 · 648 阅读 · 0 评论 -
[LeetCode]--219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.想法:这题比较简单,可原创 2016-10-11 17:28:44 · 592 阅读 · 0 评论 -
[LeetCode]--223. Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle Area Assume that the t原创 2016-10-11 23:02:06 · 641 阅读 · 0 评论 -
[LeetCode]--225. Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. empty() – Return whether原创 2016-10-13 08:58:09 · 689 阅读 · 0 评论 -
[LeetCode]--226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \ 9 6 3 1Trivia: This problem was inspired by this original tweet by Max Howell: G原创 2016-10-13 16:21:08 · 556 阅读 · 0 评论 -
[LeetCode]--231. Power of Two
Given an integer, write a function to determine if it is a power of two.Credits: Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.如果是power of two, 则2进制表达中,有且仅原创 2016-10-13 17:20:40 · 614 阅读 · 0 评论 -
[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. peek() – Get the front element. empty()原创 2016-10-13 18:03:50 · 581 阅读 · 0 评论