Coder_zyq的博客

LeetCode—Longest Substring Without Repeating Characters

最大子序列和问题 最大子序列和问题 题目描述 解题思路 直接求解On-动态规划 利用分治的方法Onlogn 代码1. 题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. Example given the array [-2

LeetCode-Assign Cookie LeetCode-Assign Cookie 问题描述 详细讲解 代码 1. 问题描述 Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at mos

Majority Element Majority Element 题目描述 算法 1 暴力求解n2 2 桶排序 n较小 3 找中位数问题 4 Divide and conquer 5 Randomization 6 Boyer-Moore Algorithm1. 题目描述 Given an array of size n, find the majority element. The m

算法概论之LeetCode- Maximum Length Of Pair Chain 算法概论之LeetCode- Maximum Length Of Pair Chain 题目描述 样例输入输出 算法描述 1. 题目描述 You are given n pairs of numbers. In every pair, the first number is

LeetCode - jump game II

jump game I

LeetCode -Best Time to Buy and Sell Stock with Cooldown LeetCode -Best Time to Buy and Sell Stock with Cooldown 题目描述 算法解释 代码 题目描述 Say you have an array for which the ith element is the p

LeetCode- Best Time to Buy and Sell Stock LeetCode- Best Time to Buy and Sell Stock 题目描述 算法理解 代码块 题目描述 Say you have an array for which the ith element is the price of a given stock o

LeetCode - kadane algorithm

Best Time to Buy and Sell Stock II Best Time to Buy and Sell Stock II 题目描述 算法解释 代码 题目描述 Say you have an array for which the ith element is the price of a given stock on day i. Design an

LeetCode –Best Time to Buy and Sell Stock III 技术与社会生态的相互作用，使得技术发展经常带来更深远的问题，远远超出了技术设备的直接目的和运作本身，同样的技术，引入不同的环境，或在不同条件下，会带来非常不同的结果 LeetCode Best Time to Buy and Sell Stock III 题目描述 算法解释 代码

算法概论第八章课后题–8.3 题目描述 STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are tr

leetCode 解题报告之Counting Bits

LeetCode- Add two number I

LeetCode–Add two Number II LeetCodeAdd two Number II 题目描述 算法解释 代码 题目描述 You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes