<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[monkey_rose的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/monkey_rose</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; monkey_rose]]></copyright><item><title><![CDATA[强连通分量]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/101429154</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/101429154</guid><author>monkey_rose</author><pubDate>Thu, 26 Sep 2019 11:19:34 +0800</pubDate><description><![CDATA[Description
贝爷的人生乐趣之一就是约战马会长. 他知道马会长喜欢和怪兽对决，于是他训练了N只怪兽，并对怪兽用0到N-1的整数进行编号. 贝爷训练怪兽的方式是让它们一对一互殴. 两只怪兽互殴会发生以下三种可能的结果：
1） 什么事也没发生
2） 第一只怪兽永远消失
3） 第二只怪兽永远消失
怪兽们经过了旷日持久的互殴. 贝爷不知道哪些怪兽进行了互殴也不知道它们互殴的顺序，但他确信无论经过...]]></description><category></category></item><item><title><![CDATA[LeetCode 120. Triangle]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/84971542</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/84971542</guid><author>monkey_rose</author><pubDate>Wed, 12 Dec 2018 13:59:56 +0800</pubDate><description><![CDATA[题目链接

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle


[
     [2],
    [3,4],
 ...]]></description><category></category></item><item><title><![CDATA[LeetCode 773. Sliding Puzzle--BFS]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/82742140</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/82742140</guid><author>monkey_rose</author><pubDate>Mon, 17 Sep 2018 15:31:54 +0800</pubDate><description><![CDATA[求最短的step这类问题可以用BFS解决，我的博客也有一道类似的题目跳蚱蜢

 

773. Sliding Puzzle

On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.

A move consists of choo...]]></description><category></category></item><item><title><![CDATA[LeetCode 200. Number of Islands&130. Surrounded Regions--DFS]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/81672093</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/81672093</guid><author>monkey_rose</author><pubDate>Tue, 14 Aug 2018 18:39:55 +0800</pubDate><description><![CDATA[两道题应该分别是我在蓝桥杯和南大夏令营遇到的原题，比较相似

题目链接

200. Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connect...]]></description><category></category></item><item><title><![CDATA[LeetCode 310. Minimum Height Trees--Graph]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/81150993</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/81150993</guid><author>monkey_rose</author><pubDate>Sun, 22 Jul 2018 00:59:26 +0800</pubDate><description><![CDATA[题目链接

For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are calle...]]></description><category></category></item><item><title><![CDATA[Playing atari with deep reinforcement learning]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79850767</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79850767</guid><author>monkey_rose</author><pubDate>Tue, 10 Apr 2018 14:35:53 +0800</pubDate><description><![CDATA[Introduction

传统RL手动提取选择特征，DL(CNN)可以根据raw sensory的数据抽象出一些high-level特征，DRL的困难：


DL训练使用大量的labeled数据，而RL数据量小，且reward和action之间的delay
DL样本间独立，RL样本间相关
RL样本的分布随着学习改变，DL中设定的固定的分布


本文针对2，3困难的方法： 
 experience...]]></description><category></category></item><item><title><![CDATA[蓝桥杯 跳蚱蜢]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79769804</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79769804</guid><author>monkey_rose</author><pubDate>Sat, 31 Mar 2018 15:35:27 +0800</pubDate><description><![CDATA[如图 p1.png 所示： 
有9只盘子，排成1个圆圈。
其中8只盘子内装着8只蚱蜢，有一个是空盘。
我们把这些蚱蜢顺时针编号为 1~8


每只蚱蜢都可以跳到相邻的空盘中，
也可以再用点力，越过一个相邻的蚱蜢跳到空盘中。


请你计算一下，如果要使得蚱蜢们的队形改为按照逆时针排列，
并且保持空盘的位置不变（也就是1-8换位，2-7换位,...），至少要经过多少次跳跃？
]]></description><category></category></item><item><title><![CDATA[蓝桥杯 剪邮票]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79768404</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79768404</guid><author>monkey_rose</author><pubDate>Sat, 31 Mar 2018 13:27:51 +0800</pubDate><description><![CDATA[剪邮票


如【图1.jpg】, 有12张连在一起的12生肖的邮票。
现在你要从中剪下5张来，要求必须是连着的。
（仅仅连接一个角不算相连）
比如，【图2.jpg】，【图3.jpg】中，粉红色所示部分就是合格的剪取。


请你计算，一共有多少种不同的剪取方法。


请填写表示方案数目的整数。
注意：你提交的应该是一个整数，不要填写任何多余的内容或说明性文字。
     ]]></description><category></category></item><item><title><![CDATA[蓝桥杯 算法提高 学霸的迷宫]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79762608</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79762608</guid><author>monkey_rose</author><pubDate>Fri, 30 Mar 2018 20:11:05 +0800</pubDate><description><![CDATA[问题描述

　　学霸抢走了大家的作业，班长为了帮同学们找回作业，决定去找学霸决斗。但学霸为了不要别人打扰，住在一个城堡里，城堡外面是一个二维的格子迷宫，要进城堡必须得先通过迷宫。因为班长还有妹子要陪，磨刀不误砍柴功，他为了节约时间，从线人那里搞到了迷宫的地图，准备提前计算最短的路线。可是他现在正向妹子解释这件事情，于是就委托你帮他找一条最短的路线。

输入格式

　　第一行两个整数n，]]></description><category></category></item><item><title><![CDATA[Reinforcement Learning - An Introduction memo]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79704641</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79704641</guid><author>monkey_rose</author><pubDate>Mon, 26 Mar 2018 21:31:01 +0800</pubDate><description><![CDATA[1.MDP(Markov Decision Processes)finite MDP: finite state space&finite action spacetransition probabilities：p(s′ | s, a) = Pr{St+1 = s′ | St = s, At = a}r(s, a, s′) = E[Rt+1 | St = s, At = a, St+1 = s′]]]></description><category></category></item><item><title><![CDATA[蓝桥杯 地宫取宝]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79457642</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79457642</guid><author>monkey_rose</author><pubDate>Tue, 06 Mar 2018 14:19:53 +0800</pubDate><description><![CDATA[问题描述
　　X 国王有一个地宫宝库。是 n x m 个格子的矩阵。每个格子放一件宝贝。每个宝贝贴着价值标签。
　　地宫的入口在左上角，出口在右下角。
　　小明被带到地宫的入口，国王要求他只能向右或向下行走。
　　走过某个格子时，如果那个格子中的宝贝价值比小明手中任意宝贝价值都大，小明就可以拿起它（当然，也可以不拿）。
　　当小明走到出口时，如果他手中的宝贝恰好是k件，则这些宝贝就可以送]]></description><category></category></item><item><title><![CDATA[蓝桥杯 方格填数]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79333938</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79333938</guid><author>monkey_rose</author><pubDate>Sun, 18 Feb 2018 09:17:22 +0800</pubDate><description><![CDATA[如下的10个格子




填入0~9的数字。要求：连续的两个数字不能相邻。
（左右、上下、对角都算相邻）

一共有多少种可能的填数方案？


解：回溯法，类似于数独那题，填每个数时判断是否存在冲突，不存在就可以继续填下一位置，结果是1580，c++代码：
#include 
#include 
#include 
using namespace std;
int leftA]]></description><category></category></item><item><title><![CDATA[LeetCode 44. Wildcard Matching--动态规划]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79053773</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79053773</guid><author>monkey_rose</author><pubDate>Sat, 13 Jan 2018 21:36:45 +0800</pubDate><description><![CDATA[题目链接
44. Wildcard
 Matching




Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty ]]></description><category></category></item><item><title><![CDATA[LeetCode 207. Course Schedule--Graph]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/79036074</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/79036074</guid><author>monkey_rose</author><pubDate>Thu, 11 Jan 2018 18:12:43 +0800</pubDate><description><![CDATA[题目链接
207. Course
 Schedule


There are a total of n courses you have to take, labeled from 0 to n
 - 1.

Some courses may have prerequisites, for example to take course 0 you have to first tak]]></description><category></category></item><item><title><![CDATA[Sicily 1004. 拓扑序[Special judge]]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78965451</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78965451</guid><author>monkey_rose</author><pubDate>Wed, 03 Jan 2018 21:16:35 +0800</pubDate><description><![CDATA[Description

在图论中，拓扑序（Topological Sorting）是一个有向无环图（DAG, Directed Acyclic Graph）的所有顶点的线性序列. 且该序列必须满足下面两个条件：
 
1.       每个顶点出现且只出现一次.
2.       若存在一条从顶点 A 到顶点 B 的路径，那么在序列中顶点 A 出现在顶点 B 的前面.
 
对于一个含]]></description><category></category></item><item><title><![CDATA[KITE--NP-complete]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78961898</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78961898</guid><author>monkey_rose</author><pubDate>Wed, 03 Jan 2018 16:50:53 +0800</pubDate><description><![CDATA[8.19
A kite is a graph on an even number of vertices, say 2n, in which n of the vertices form a clique and the remaining n vertices are connected in a "tail" that consists of a path joined to one of ]]></description><category></category></item><item><title><![CDATA[LeetCode 141. Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78885939</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78885939</guid><author>monkey_rose</author><pubDate>Sun, 24 Dec 2017 17:16:46 +0800</pubDate><description><![CDATA[题目链接

141. Linked
 List Cycle


Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?



解：
满足 without using extra space这个要求的话，可]]></description><category></category></item><item><title><![CDATA[LeetCode 112. Path Sum--递归]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78885597</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78885597</guid><author>monkey_rose</author><pubDate>Sun, 24 Dec 2017 16:20:32 +0800</pubDate><description><![CDATA[题目链接

112. Path
 Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
For example:
Given the]]></description><category></category></item><item><title><![CDATA[LeetCode 60. Permutation Sequence]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78760874</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78760874</guid><author>monkey_rose</author><pubDate>Sat, 09 Dec 2017 19:10:56 +0800</pubDate><description><![CDATA[题目链接

60. Permutation Sequence


The set [1,2,3,…,n] contains
 a total of n! unique permutations.
By listing and labeling all of the permutations in order,
We get the following sequence (ie, f]]></description><category></category></item><item><title><![CDATA[LeetCode 236. Lowest Common Ancestor of a Binary Tree--递归]]></title><link>https://blog.youkuaiyun.com/monkey_rose/article/details/78748131</link><guid>https://blog.youkuaiyun.com/monkey_rose/article/details/78748131</guid><author>monkey_rose</author><pubDate>Fri, 08 Dec 2017 09:36:12 +0800</pubDate><description><![CDATA[题目链接

236. Lowest Common Ancestor of a Binary Tree


Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia:]]></description><category></category></item></channel></rss>