LeetCode
att0206
C/C++、Qt、ISP、图像处理(增强、降噪)、Opencv、ncnn、机器学习、深度学习、边缘计算、arm算法优化等领域,望能跟共同志向者一同学习交流!
展开
-
LeetCode之移除已排序数组中的相同元素
描述: 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 another array, you must d...原创 2018-08-17 18:41:02 · 125 阅读 · 0 评论 -
LeetCode之Longest Consecutive Sequence
Descrition: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is...原创 2018-08-16 18:54:06 · 153 阅读 · 0 评论 -
LeetCode之Remove Duplicates from Sorted Array II
题目描述: Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3], Your function should return length = 5, and A is now [1,1,2...原创 2018-08-20 17:56:09 · 123 阅读 · 0 评论 -
《LeetCode》之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 all va...原创 2018-08-28 11:46:43 · 148 阅读 · 0 评论 -
LeetCode之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...原创 2018-08-21 15:18:38 · 175 阅读 · 0 评论 -
LeetCode之jumpgame
Descrition: 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. De...原创 2018-09-04 22:15:07 · 156 阅读 · 0 评论 -
LeetCode之Longest Substring Without Repeating Characters
Descrition: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the len...原创 2018-09-06 17:49:25 · 168 阅读 · 0 评论 -
LeetCode之Best Time to Buy and Sell Stock
Descrition: //Say you have an array for which the i - th element is the price of a given stock on day i. //If you were only permitted to complete at most one transaction(ie, buy one and sell one share...原创 2018-10-12 15:33:22 · 164 阅读 · 0 评论