<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[心向往之！！]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/blackmail3</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; blackmail3]]></copyright><item><title><![CDATA[2/1/2022 刷题总结]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/122282458</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/122282458</guid><author>blackmail3</author><pubDate>Sun, 02 Jan 2022 23:57:04 +0800</pubDate><description><![CDATA[Leetcode

最大子序列和：


if sum &gt; 0: 
    sum += num[i]
else:
    sum = num[i]
ans = max(sum, ans)

岛屿计数（DFS）


for(int i = 0; i &lt; m; i++){
    for(int j = 0; j &lt; n; j++){
        dfs(i, j, arr);
        cnt++;
    }
}

dfs(int i, int j, int[][] arr){
]]></description><category></category></item><item><title><![CDATA[笔记20210708]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/118582256</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/118582256</guid><author>blackmail3</author><pubDate>Thu, 08 Jul 2021 21:38:39 +0800</pubDate><description><![CDATA[NC22合并两个有序的数组

给出一个整数数组A和有序的整数数组B，请将数组B合并到数组A中，变成一个有序的升序数组
注意：
1.可以假设A数组有足够的空间存放B数组的元素，A和B中初始的元素数目分别为M和N,的数组空间大小为M+N

2.不要返回合并的数组，返回是空的，将数组B的数据合并到A里面就好了

3.数组在[0,m-1]的范围也是有序的



例1:

A:[1,2,3,0,0,0]，m=3

B: [2,5,6]，n=3

合并过后A为:

A: [1,2,2,3,5,6]


从大到小...]]></description><category></category></item><item><title><![CDATA[Leetcode刷题Day1]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/109590273</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/109590273</guid><author>blackmail3</author><pubDate>Tue, 10 Nov 2020 00:48:19 +0800</pubDate><description><![CDATA[许久没写代码了，也不是很熟悉Leetcode的运行机制，适应了有一段时间。

简简单单的两链表相加操作，主要是不是很理解自定的ListNode类，常报空指针的错误导致调试了很长时间。。。

tips: 自己的代码有点啰嗦了，学习一下官方代码


给出两个非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照逆序的方式存储的，并且它们的每个节点只能存储一位数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0开头。...]]></description><category></category></item><item><title><![CDATA[poj 3279 Fliptile(DFS 二进制运算)-黑白棋]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81393604</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81393604</guid><author>blackmail3</author><pubDate>Tue, 07 Aug 2018 18:46:43 +0800</pubDate><description><![CDATA[题目链接：

http://poj.org/problem?id=3279

Fliptile

Time Limit: 2000MS
			 
			Memory Limit: 65536K
		Total Submissions: 16162
			 
			Accepted: 5903
		Description

Farmer John knows that an intellectual...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 5 1005 Everything Has Changed]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81486375</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81486375</guid><author>blackmail3</author><pubDate>Tue, 07 Aug 2018 18:44:10 +0800</pubDate><description><![CDATA[ Problem Description

Edward is a worker for Aluminum Cyclic Machinery. His work is operating mechanical arms to cut out designed models. Here is a brief introduction of his work.
Assume the operating...]]></description><category></category></item><item><title><![CDATA[POJ 2387 Til the Cows Come Home（最短路径Dijkstra）]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81364431</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81364431</guid><author>blackmail3</author><pubDate>Thu, 02 Aug 2018 17:30:31 +0800</pubDate><description><![CDATA[Time Limit: 1000MS
			 
			Memory Limit: 65536K
		Total Submissions: 71737
			 
			Accepted: 23963
		Description

Bessie is out in the field and wants to get back to the barn to get as much sleep as p...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 3 Problem F. Grab The Tree（博弈论&二进制运算）]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81316797</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81316797</guid><author>blackmail3</author><pubDate>Tue, 31 Jul 2018 17:09:41 +0800</pubDate><description><![CDATA[ Problem Description

Little Q and Little T are playing a game on a tree. There are n vertices on the tree, labeled by 1,2,...,n, connected by n−1 bidirectional edges. The i-th vertex has the value of...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 3 Problem L. Visual Cube]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81295835</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81295835</guid><author>blackmail3</author><pubDate>Tue, 31 Jul 2018 09:18:43 +0800</pubDate><description><![CDATA[Problem Description

Little Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he meets a 3D geometry problem, he will struggle to draw a pic...]]></description><category></category></item><item><title><![CDATA[HDU 1069 Monkey and Banana(DP)]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81275851</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81275851</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 21:34:46 +0800</pubDate><description><![CDATA[Problem Description

A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with som...]]></description><category></category></item><item><title><![CDATA[HDU 1024 Max Sum Plus Plus(DP)]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81275594</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81275594</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 21:28:01 +0800</pubDate><description><![CDATA[ Problem Description

Now I think you have got an AC in Ignatius.L's &quot;Max Sum&quot; problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more dif...]]></description><category></category></item><item><title><![CDATA[POJ - 2251 Dungeon Master（BFS）]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81275436</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81275436</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 21:07:52 +0800</pubDate><description><![CDATA[Description

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit...]]></description><category></category></item><item><title><![CDATA[HDU - 2612 Find a way（BFS）]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81216898</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81216898</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 20:56:50 +0800</pubDate><description><![CDATA[ Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. 
Yifenfei’s home is at the c...]]></description><category></category></item><item><title><![CDATA[POJ-棋盘问题（DFS）]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81222294</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81222294</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 20:53:30 +0800</pubDate><description><![CDATA[ 在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input

输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n &amp;lt;= 8 , k &amp;lt;= ...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 2 1010 Swaps and Inversions]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81275231</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81275231</guid><author>blackmail3</author><pubDate>Sun, 29 Jul 2018 20:48:16 +0800</pubDate><description><![CDATA[ 思路很简单， 求逆序数然后乘上x， y里面较大的那个，但是一开始只会暴力求法。。。队友写了并归然后赛后也学了并归算法，嗯感觉有一点二分的意思，据dalao说还有树状数组的方法，看了看博客还是不大懂。。。跟二进制有关就容易晕。。。要继续加油啊。

Problem Description

Long long ago, there was an integer sequence a.
Tonyfan...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 1 1001 Maximum Multiple]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81185726</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81185726</guid><author>blackmail3</author><pubDate>Wed, 25 Jul 2018 20:24:22 +0800</pubDate><description><![CDATA[Problem Description

Given an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum.

Input

There are multiple test cases. The f...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 1 1004Distinct Values 代码学习]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81190444</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81190444</guid><author>blackmail3</author><pubDate>Wed, 25 Jul 2018 20:19:37 +0800</pubDate><description><![CDATA[Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3336    Accepted Submission(s): 523

Problem Description

Chiaki has an array of n positive int...]]></description><category></category></item><item><title><![CDATA[HDU1495 非常可乐]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81198394</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81198394</guid><author>blackmail3</author><pubDate>Wed, 25 Jul 2018 20:12:16 +0800</pubDate><description><![CDATA[Problem Description

大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S&amp;lt;101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 1 1011 标程学习]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81185672</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81185672</guid><author>blackmail3</author><pubDate>Tue, 24 Jul 2018 15:34:02 +0800</pubDate><description><![CDATA[Time Zone

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5204    Accepted Submission(s): 878

Problem Description

Chiaki often participates ...]]></description><category></category></item><item><title><![CDATA[2018 Multi-University Training Contest 1 1003 Triangle Partition]]></title><link>https://blog.youkuaiyun.com/blackmail3/article/details/81178746</link><guid>https://blog.youkuaiyun.com/blackmail3/article/details/81178746</guid><author>blackmail3</author><pubDate>Tue, 24 Jul 2018 09:47:35 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)
Total Submission(s): 2140    Accepted Submission(s): 925Special Judge

Problem Description

Chiaki has 3n points p...]]></description><category></category></item></channel></rss>