Leetcode
五月茶微凉
这个作者很懒,什么都没留下…
展开
-
Reverse Integer(算法分析week5)
Reverse Integer题目来源:https://leetcode.com/problems/algorithm/-问题描述- -解题思路- -代码实现-问题描述Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321解题思路(1)利用余数和除数将数字中的每一位存入原创 2017-10-02 14:16:22 · 140 阅读 · 0 评论 -
Climbing Stairs(算法分析week9)
Climbing Stairs题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:动态规划-题目描述- -解题思路- -代码实现-题目描述You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb原创 2017-11-03 22:38:03 · 219 阅读 · 0 评论 -
Task Scheduler(算法分析week8)
Task Scheduler题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:贪心算法-题目描述- -实现思路- -代码实现-题目描述Given a char array representing tasks CPU need to do. It contains capital letters A to Z where differe原创 2017-10-27 21:28:07 · 264 阅读 · 0 评论 -
Best Time to Buy and Sell Stock II(算法分析week7)
Best Time to Buy and Sell Stock II题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:贪心算法-问题描述- -解题思路- -代码实现-问题描述Say you have an array for which the ith element is the price of a given stock on d原创 2017-10-19 13:10:15 · 168 阅读 · 0 评论 -
Assign Cookies(算法分析week7)
Assign Cookies题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:贪心算法-问题描述- -解题思路- -代码实现-问题描述Assume you are an awesome parent and want to give your children some cookies. But, you should give eac原创 2017-10-19 00:15:55 · 159 阅读 · 0 评论 -
Palindrome Number(算法分析week6)
Palindrome Number题目来源:https://leetcode.com/problemset/algorithms/-问题描述- -解题思路- -代码实现-问题描述原创 2017-10-15 00:15:12 · 142 阅读 · 0 评论 -
Leetcode714. Best Time to Buy and Sell Stock with Transaction Fee (算法分析week13)
Best Time to Buy and Sell Stock with Transaction Fee题目来源:https://leetcode.com/problemset/algorithms/-题目描述- -算法分析- -代码实现-题目描述Your are given an array of integers prices, for which the i-th element is t原创 2017-12-02 11:48:18 · 211 阅读 · 0 评论 -
Leetcode 647.Palindromic Substrings(算法分析week15)
Palindromic Substrings-问题描述- -算法分析- -代码实现-问题描述Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are co原创 2017-12-19 19:52:05 · 157 阅读 · 0 评论 -
Leetcode 413. Arithmetic Slices(算法分析week15)
Arithmetic Slices-问题描述- -算法分析- -代码实现-问题描述A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same. F原创 2017-12-23 01:05:40 · 165 阅读 · 0 评论 -
Leetcode 738. Monotone Increasing Digits(算法分析week16)
Monotone Increasing Digits-问题描述- -算法分析- -代码实现-问题描述Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits. (Recall that an integer ha原创 2017-12-23 14:10:45 · 199 阅读 · 0 评论 -
Leetcode 416 Partition Equal Subset Sum (算法分析week14)
Partition Equal Subset Sum题目来源:https://leetcode.com/problemset/algorithms/-题目描述- -算法分析- -代码实现-题目描述Given a non-empty array containing only positive integers, find if the array can be partitioned into原创 2017-12-07 13:11:25 · 152 阅读 · 0 评论 -
Leetcode 392. Is Subsequence(算法分析week16)
Is Subsequence-问题描述- -算法分析- -代码实现-问题描述Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a原创 2017-12-31 18:02:44 · 318 阅读 · 0 评论 -
证明吝啬SAT问题为NP完全问题(算法分析week18)
证明吝啬AT问题为NP完全问题-问题描述- -证明过程-问题描述吝啬SAT问题是这样的:给定一组子句(每个子句都是其中文字的析取)和整数k,求一个最多有k个变量为true的满足赋值——如果该赋值存在。证明吝啬SAT是NP-完全问题。证明过程证明吝啬SAT是NP-完全问题可以通过将SAT问题归约为吝啬SAT问题得到。SAT问题等价于k=n的吝啬SAT问题,那么吝啬SAT问题有解时SAT问题一定有解,原创 2018-01-03 21:19:56 · 245 阅读 · 0 评论 -
Leetcode 646. Maximum Length of Pair Chain(算法分析week14)
Maximum Length of Pair Chain-问题描述- -算法分析- -代码实现-问题描述You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can foll原创 2017-12-18 23:26:23 · 140 阅读 · 0 评论 -
Best Time to Buy and Sell Stock(算法分析week9)
Best Time to Buy and Sell Stock题目来源:https://leetcode.com/problemset/algorithms/-题目描述- -解题思路- -代码实现-题目描述Say you have an array for which the ith element is the price of a given stock on day i. If you原创 2017-11-03 23:03:22 · 165 阅读 · 0 评论 -
Range Sum Query - Immutable(算法分析 week10)
Range Sum Query - Immutable题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:动态编程-题目描述- -解题思路- -代码实现-题目描述Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j)原创 2017-11-10 14:05:58 · 184 阅读 · 0 评论 -
Range Sum Query 2D - Immutable(算法分析 week10)
Range Sum Query 2D - Immutable题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:动态规划-题目描述- -解题思路- -代码实现-题目描述Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by原创 2017-11-10 14:41:15 · 172 阅读 · 0 评论 -
Longest Substring Without Repeating Characters(算法分析week4)
Longest Substring Without Repeating Characters题目来源:https://leetcode.com/problems/-问题描述- -解题思路- -代码实现-问题描述Given a string, find the length of the longest substring without repeating characters.Examples原创 2017-10-02 10:56:27 · 177 阅读 · 0 评论 -
Leetcode 712 Minimum ASCII Delete Sum for Two Strings (算法分析week13)
Minimum ASCII Delete Sum for Two Strings题目来源:https://leetcode.com/problemset/algorithms/题目描述算法分析代码实现题目描述Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings原创 2017-12-01 23:07:36 · 196 阅读 · 0 评论 -
Maximum Length of Repeated Subarray(算法分析week12)
Maximum Length of Repeated Subarray题目来源:https://leetcode.com/problemset/algorithms/-题目描述- -解题思路- -代码实现-题目描述Given two integer arrays A and B, return the maximum length of an subarray that appears in b原创 2017-11-25 23:48:58 · 196 阅读 · 0 评论 -
Queue Reconstruction by Height(算法分析week8)
Queue Reconstruction by Height题目来源:https://leetcode.com/problemset/algorithms/ 题目类型:贪心算法-题目描述- -解题思路- -代码实现-题目描述Suppose you have a random list of people standing in a queue. Each person is原创 2017-10-25 23:46:43 · 175 阅读 · 0 评论 -
ZigZag Conversion(算法分析week4)
ZigZag Conversion题目来源:https://leetcode.com/problems/-问题描述- -解题思路- -代码实现-问题描述The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display th原创 2017-10-02 11:17:25 · 159 阅读 · 0 评论 -
String to Integer (atoi)(算法分析week6)
String to Integer (atoi)题目来源:https://leetcode.com/problems/algorithm/-问题描述- -解体思路- -代码实现-问题描述Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input ca原创 2017-10-09 19:26:07 · 129 阅读 · 0 评论 -
Search a 2D Matrix II (算法分析week3)
Search a 2D Matrix II题目来源:https://leetcode.com/problems/ -问题描述 -解题思路 -代码实现问题描述Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Inte原创 2017-09-18 23:54:23 · 339 阅读 · 0 评论 -
Longest Palindromic Substring(算法分析week3)
Longest Palindromic Substring题目来源:https://leetcode.com/problems/-问题描述- -解题思路- -代码实现-问题描述Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1原创 2017-10-02 10:21:53 · 150 阅读 · 0 评论 -
Majority Element(算法分析week2)
Majority Element问题描述解题思路代码实现问题描述Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-原创 2017-09-14 22:31:24 · 218 阅读 · 0 评论 -
Maximum Subarray (算法分析week2)
Maximum Subarray题目来源:https://leetcode.com/problemset/algorithms/ -问题描述 -解题思路 -代码实现问题描述Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For e原创 2017-09-14 23:56:42 · 198 阅读 · 0 评论 -
Add Two Numbers(算法分析week1)
Add Two Numbers题目来源:https://leetcode.com/problemset/algorithms/原创 2017-09-10 15:43:54 · 251 阅读 · 0 评论 -
TwoSum(算法分析课week1)
TwoSum题目来源:https://leetcode.com/problemset/algorithms/问题描述解题思路代码实现问题描述Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that原创 2017-09-09 20:53:20 · 203 阅读 · 0 评论 -
N-Queens(算法分析week11)
N-Queens题目来源:https://leetcode.com/problemset/algorithms/-题目描述- -实现思路- -代码实现-题目描述The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.原创 2017-11-20 22:25:13 · 159 阅读 · 0 评论 -
Leetcode215. Kth Largest Element in an Array(算法分析week17)
Kth Largest Element in an Array-问题描述- -算法分析- -代码实现-问题描述Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. F原创 2018-01-11 20:55:21 · 162 阅读 · 0 评论