<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Bowen_Wu_的博客]]></title><description><![CDATA[Dream Big and Aim High!]]></description><link>https://blog.youkuaiyun.com/bowen_wu_sysu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bowen_wu_sysu]]></copyright><item><title><![CDATA[习题8.15]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79094684</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79094684</guid><author>bowen_wu_sysu</author><pubDate>Thu, 18 Jan 2018 12:41:13 +0800</pubDate><description><![CDATA[题目

Show that the following problem is NP-complete. 
MAXIMUM COMMON SUBGRAPH 
Input: Two graphs G1 = (V1, E1) and G2 = (V2, E2); a budget b. 
Output: Two set of nodes V1′ ⊆ V1 and V2′ ⊆ V2 whose delet]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--763. Partition Labels]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79094610</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79094610</guid><author>bowen_wu_sysu</author><pubDate>Thu, 18 Jan 2018 12:24:31 +0800</pubDate><description><![CDATA[描述

A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representin]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--309. Best Time to Buy and Sell Stock with Cooldown]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79091440</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79091440</guid><author>bowen_wu_sysu</author><pubDate>Thu, 18 Jan 2018 01:00:16 +0800</pubDate><description><![CDATA[描述

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 the maximum profit. You may complete as many transactions as you like (ie, buy]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--188. Best Time to Buy and Sell Stock IV]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79086937</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79086937</guid><author>bowen_wu_sysu</author><pubDate>Wed, 17 Jan 2018 16:53:55 +0800</pubDate><description><![CDATA[描述

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 the maximum profit. You may complete at most k transactions.

Note: 
You may no]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--123. Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79084043</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79084043</guid><author>bowen_wu_sysu</author><pubDate>Wed, 17 Jan 2018 13:33:24 +0800</pubDate><description><![CDATA[描述

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 the maximum profit. You may complete at most two transactions.

Note: 
You may]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--122. Best Time to Buy and Sell Stock II]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79083704</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79083704</guid><author>bowen_wu_sysu</author><pubDate>Wed, 17 Jan 2018 11:54:15 +0800</pubDate><description><![CDATA[描述

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 the maximum profit. You may complete as many transactions as you like (ie, buy]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--121. Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79083622</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/79083622</guid><author>bowen_wu_sysu</author><pubDate>Wed, 17 Jan 2018 11:48:11 +0800</pubDate><description><![CDATA[描述

Say you have an array for which the ith 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 of the stock]]></description><category></category></item><item><title><![CDATA[Matlab使用笔记-uint8类型之间的运算的坑]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78878800</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78878800</guid><author>bowen_wu_sysu</author><pubDate>Sat, 23 Dec 2017 11:06:11 +0800</pubDate><description><![CDATA[在matlab中，uint8的为无符号8位整数，范围 ： [0 255]，那么当越界时会发生什么呢？小于0:>> uint8(-1)ans =    0大于255:uint8(266)ans =  255这都比较自然，没什么。我今天遇到的使我犯错的是这样一个东西，如果两个uint8相减产生了越界会发生什么呢？我之前一直以为matlab会将类型进行转换，然而实际上并不会，运算后结果仍旧是uint8>>]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--714. Best Time to Buy and Sell Stock with Transaction Fee]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78792446</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78792446</guid><author>bowen_wu_sysu</author><pubDate>Wed, 13 Dec 2017 16:39:53 +0800</pubDate><description><![CDATA[描述Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.You may complete as many t]]></description><category></category></item><item><title><![CDATA[数字图像处理-提取A4纸中线条-matlab的轮廓提取方法]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78745038</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78745038</guid><author>bowen_wu_sysu</author><pubDate>Thu, 07 Dec 2017 23:17:20 +0800</pubDate><description><![CDATA[这篇文章主要讲述的是使用一种十分naive的方法通过matlab实现以下轮廓提取的任务： 
输入是一张A4纸： 
 
需要分别输出纸上7个线条所在的区域： 
思路首先将线条提取出来，然后找出暗处连通的区域，在一个连通的区域中找出最小和最大的横纵坐标，根据横纵坐标圈出一块矩形区域即可。实现1 将彩色图转为灰度图input = imread('input.jpg');
input_gray = rgb2]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--712. Minimum ASCII Delete Sum for Two Strings]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78428635</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78428635</guid><author>bowen_wu_sysu</author><pubDate>Thu, 02 Nov 2017 19:52:01 +0800</pubDate><description><![CDATA[描述Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1: 
Input: s1 = “sea”, s2 = “eat” 
Output: 231 
Explanation: Deleting “s” from “sea” adds t]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--718. Maximum Length of Repeated Subarray]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78418938</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78418938</guid><author>bowen_wu_sysu</author><pubDate>Wed, 01 Nov 2017 21:29:40 +0800</pubDate><description><![CDATA[描述Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.Example 1: 
Input: 
A: [1,2,3,2,1] 
B: [3,2,1,4,7] 
Output: 3 
Explanation:  
The repeated subar]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--685. Redundant Connection II]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78272585</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78272585</guid><author>bowen_wu_sysu</author><pubDate>Wed, 18 Oct 2017 14:38:06 +0800</pubDate><description><![CDATA[描述In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, exce]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--684. Redundant Connection]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78192413</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78192413</guid><author>bowen_wu_sysu</author><pubDate>Tue, 10 Oct 2017 14:36:22 +0800</pubDate><description><![CDATA[描述In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, …, N), with one additiona]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--215. Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78016471</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/78016471</guid><author>bowen_wu_sysu</author><pubDate>Mon, 18 Sep 2017 10:30:22 +0800</pubDate><description><![CDATA[描述Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example, 
Given [3,2,1,5,6,4] and k = 2, return 5.Note]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--5. Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77915105</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77915105</guid><author>bowen_wu_sysu</author><pubDate>Sat, 09 Sep 2017 14:29:49 +0800</pubDate><description><![CDATA[描述Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”Note: “aba” is also a valid answer. 
Example:Inpu]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--1. Two Sum]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77914996</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77914996</guid><author>bowen_wu_sysu</author><pubDate>Sat, 09 Sep 2017 14:14:58 +0800</pubDate><description><![CDATA[描述Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same e]]></description><category></category></item><item><title><![CDATA[LeetCode题解系列--4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77870887</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/77870887</guid><author>bowen_wu_sysu</author><pubDate>Wed, 06 Sep 2017 20:14:04 +0800</pubDate><description><![CDATA[描述： 
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).]]></description><category></category></item><item><title><![CDATA[Unity3D学习笔记（四）牧师和魔鬼游戏改进]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/64619006</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/64619006</guid><author>bowen_wu_sysu</author><pubDate>Tue, 21 Mar 2017 23:39:54 +0800</pubDate><description><![CDATA[在上次做的牧师和魔鬼的游戏中，场记基本负责了所有的工作，加载资源，移动游戏对象，很明显这样的游戏结构很难维护，很难拓展，很不面向对象，所以这次的工作就是利用工厂模式来生产动作。弥补了上次没有上船动作的缺点。先上UML图： 
UML图实在是花的丑，有空再改。工厂模式解释：CCAction, CCSequenceAction等就是工厂，他的产品就是SSAction，由SSActionManager统一管]]></description><category></category></item><item><title><![CDATA[Unity3D笔记（三）牧师和魔鬼的游戏]]></title><link>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/64439786</link><guid>https://blog.youkuaiyun.com/bowen_wu_sysu/article/details/64439786</guid><author>bowen_wu_sysu</author><pubDate>Tue, 21 Mar 2017 11:39:46 +0800</pubDate><description><![CDATA[这次做的是一个魔鬼和牧师的游戏 
游戏DEMO
  Priests and Devils is a puzzle game in which you will help the 
  Priests and Devils to cross the river within the time limit. 
  There are 3 priests and 3 devils at one side]]></description><category></category></item></channel></rss>