louiewu-优快云博客

原创 [行为识别论文理解]Two-Stream ConvNet

[行为识别论文理解]Two-Stream Convolutional Networks for Action Recognition in Videos 摘要: 1. 提出三个贡献: 提出two-stream convnet的网络结构，包括空间卷积网络(spatial network)即时间卷积网络(temporal network)、证明在多帧密集光流的convnet上并在有限数据集下获得更好...

2019-10-10 23:04:49 1012

原创期末NP完全問題

本次是關於算法課程期末NP完全問題的證明，首先題目: In the HITTING SET problem,we are given a family of sets{s1,s2,.......，sn}and a budget b,and we wish to find a set H of size 大致的要求是給定一組集合{s1, s2, s3,......,

2017-07-08 14:59:40 269

原创 Binary Tree Paths

本次的題目要求尋找樹根到葉子的所有路徑，並以string的方式輸出。基本思想上我所採用深度優先搜索算法(DP)解決樹的問題。 Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5

2017-06-18 23:00:20 229

原创 Partition Equal Subset Sum

本次題目也是關於動態規劃的練習，Partition Equal Subset Sum，題目要求如下: Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements i

2017-06-04 21:03:33 258

原创 Target Sum

本週選做的題目也是關於動態規劃的應用，Target Sum，題目要求如下: You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one fr

2017-05-28 21:22:42 249

原创 Longest Palindromic Subsequence

本次題目是有關於動態規劃的練習，Longest Palindromic Subsequence，目的是找出在給定的字串中最長的回蚊子字串的長度。 Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.

2017-05-21 20:28:36 246

原创 Continuous Subarray Sum

本次題目是有關於動態規劃的應用，Continuous Subarray Sum，題目的大致要求如下: Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2

2017-05-15 09:52:06 310

原创 Friend Circles

本此的題目是關於深度優先算法(DFS)的應用，Friend Circles，題目如下: There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct

2017-05-07 17:21:02 304

原创 Is Subsequence

本次的主題是關於檢測 subsequence，初始給出字串S與T，目的是要檢測在T中S是否存在在其中。 Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and

2017-04-23 19:12:55 190

原创 Assign Cookies

本次選作的主題是有關利用貪心算法(greedy sort)概念，Assign Cookies，題目的大致要求如下: Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Eac

2017-04-17 00:22:58 230

原创 Minimum Height Trees

本此選做的題目是有關於圖與樹的應用Minimum Height Trees，大致的要求如下 The graph contains n nodes which are labeled from 0 to n - 1. You will be given the number n and a list of undirected edges (each edge is a pair

2017-04-09 11:36:25 176

原创 Course Schedule

其實這道題目要求看似有難度，但反覆思考題目後會發現其實根本上只是利用深度搜索(DFS)以及拓譜排序尋找是否有環的出現以及主要在網上搜尋關於DFS檢測環的算法並參考，背景是關於課程的先後順序，譬如說在上高級編成之前要有C++的基礎等等，如果有出現則返回錯誤。 There are a total of n courses you have to take, labeled from 0 to

2017-03-26 22:59:18 228

原创 Find Largest Value in Each Tree Row

本次的主題是希望圖形、樹以及鏈表深度搜索(DFS)的結合可以簡單搜索樹中每一行最大的數，並把它存儲在新創建的vector內，首先我們先給出樹的簡單結構: //Definition for a binary tree node. struct TreeNode { int val; TreeNode *left; TreeNode *right; Tr

2017-03-19 19:57:13 237

原创 Merge k Sorted Lists

本此的主題主要違歸併排序的應用Merge k Sorted Lists並且透過鏈表實現，首先我們先設置各個節點的模塊: Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} };

2017-03-12 17:25:50 258

原创 Kth Largest Element in an Array

本次選做題目為:Kth Largest Element in an Array，題目要求為給定一段有序或無序的鏈表並用分而治制的方法求出鏈表中第二大的內容。 For example, Given [3,2,1,5,6,4] and k = 2, return 5. 在構思這道題目的時候，首先採用對鏈表進行排序，我所採用排序方法為快速排序，在求出有序鏈表中第二大的項目。下面代碼

2017-03-05 16:52:32 216

原创 odd even linked list

本次所選做的題目: odd even linked list，題目的要求為給定一鍛鏈表，根據鏈表中各個節點中數字的奇偶做分類，奇數在前偶數在後形成一個新的鏈表，並且完成的時間複雜度在O(n)。 Example: Given 1->2->3->4->5->NULL, return 1->3->5->2->4->NULL. 關於奇偶數鏈表分類的函數為ListNode oddeven

2017-02-26 21:58:53 216

louiewu的博客