![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
小煤矿屁
游戏后端出身的算法工程师,目前从事机器学习相关的研发,技术栈:统计机器学习,spark ML,c++,python
展开
-
(1)Two Sum-----LeetCode
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where原创 2015-06-03 00:23:14 · 476 阅读 · 0 评论 -
LeetCode动态规划198. House Robber思路解析
LeetCode动态规划198. House Robber思路解析,用最容易理解的递归解释原创 2016-03-16 00:57:56 · 625 阅读 · 0 评论 -
646. 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 follow another pair (a, b) if and only if b < c. Chain of p原创 2017-08-17 15:34:07 · 351 阅读 · 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 t原创 2017-08-17 18:12:15 · 493 阅读 · 0 评论 -
Leetcode 650. 2 Keys Keyboard
题目Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:Copy All: You can copy all the characters present on the notepad (partial copy i原创 2017-08-13 14:17:53 · 2713 阅读 · 0 评论 -
Leetcode 300. Longest Increasing Subsequences (nlogn复杂度)思路解析
题目Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefo原创 2017-08-21 01:23:00 · 527 阅读 · 0 评论 -
Leetcode 3. Longest Substring Without Repeating Characters思路解析
题目Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with the原创 2017-08-15 02:02:52 · 276 阅读 · 0 评论