原创 Leetcode: 39. Combination Sum(Week12, Medium)

Leetcode39: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique comb

原创 Leetcode: 130. Surrounded Region(Week7, Medium)

注: 本題使用BFS算法求解 Leetcode 130 Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded

原创 Re-ID: Reidentification by Relative Distance Comparison 論文解析

注:剛剛看完了這篇論文,順便整理了一下這篇論文的思路,還是得膜一下偉詩大佬,666 論文地址:Person Re-identification 論文解析 Matching people across nonoverlapping ca

原创 DeepLearning: Matrix capsules with EM Routing 學習筆記

以下是我個人的學習筆記~ 僅供學習使用

原创 Leetcode: 16. 3Sum Closest(Week5, Medium)

Leetcode 16 Given an array S of n integers, find three integers in S such that the sum is closest to a given number

原创 Leetcode: 73. Set Matrix Zeroes(Week15, Medium)

Leetcode 73 Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. 題意:將矩陣中

原创 Leetcode: 216. Combination Sum III(Week14, Medium)

Leetcode 216 Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1

原创 Leetcode: 515.Find Largest Value in Each Tree Row(Week10, Medium)

注:本題採用的是BFS算法 Leetcode 515 You need to find the largest value in each row of a binary tree. Example: Input:

原创 Leetcode: 322. Coin Change(Week8, Medium)

注:本題是需要裝滿的完全揹包問題 Leetcode 322 You are given coins of different denominations and a total amount of money amount. W

原创 Re-ID: Person Re-identification by Local Maximal Occurrence Representation and Metric Learning 論文解析

注: 剛剛看完了這篇論文,順便整理了一下這篇論文的思路,對論文的方法表示666 項目主頁:http://www.cbsr.ia.ac.cn/users/scliao/projects/lomo_xqda/ 論文解析 行人重識別有兩個特

原创 Leetcode: 43.Multiply Strings(Week11, Medium)

注:本題使用的是高精度乘法的思路 Leetcode 43 Given two non-negative integers num1 and num2 represented as strings, return the prod

原创 Leetcode: 133. Clone Graph(Week6, Medium)

注:本題使用BFS算法 Leetcode 133 Clone an undirected graph. Each node in the graph contains a label and a list of its neig