原创 LeetCode題解系列--712. Minimum ASCII Delete Sum for Two Strings
描述 Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Inp
2018-09-04 15:25:44
原创 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.
2018-09-04 15:25:44
原创 LeetCode題解系列--718. Maximum Length of Repeated Subarray
描述 Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1:
2018-09-04 15:25:44
原创 Matlab使用筆記-uint8類型之間的運算的坑
在matlab中，uint8的爲無符號8位整數，範圍 ： [0 255]，那麼當越界時會發生什麼呢？ 小於0: >> uint8(-1) ans = 0 大於255: uint8(266) ans = 255 這都比較
2018-09-04 15:25:44
原创 LeetCode題解系列--122. 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 algorithm to find
2018-09-04 15:25:44
2
原创 LeetCode題解系列--763. Partition Labels
描述 A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that ea
2018-09-04 15:25:44
原创 數字圖像處理-提取A4紙中線條-matlab的輪廓提取方法
這篇文章主要講述的是使用一種十分naive的方法通過matlab實現以下輪廓提取的任務： 輸入是一張A4紙： 需要分別輸出紙上7個線條所在的區域： 思路 首先將線條提取出來，然後找出暗處連通的區域，在一個連通的區域中找出最小和
2018-09-04 15:25:44
32
原创 LeetCode題解系列--4. Median of Two Sorted Arrays
描述： There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays
2018-09-04 15:25:44
1
原创 LeetCode題解系列--685. Redundant Connection II
描述 In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all oth
2018-09-04 15:25:44
原创 LeetCode題解系列--123. Best Time to Buy and Sell Stock III
描述 Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find
2018-09-04 15:25:43
2