<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fighting!]]></title><description><![CDATA[空白]]></description><link>https://blog.csdn.net/LaputaFallen</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; LaputaFallen]]></copyright><item><title><![CDATA[辞职考研上岸北大软微]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/124019946</link><guid>https://blog.csdn.net/LaputaFallen/article/details/124019946</guid><author>LaputaFallen</author><pubDate>Thu, 07 Apr 2022 16:34:30 +0800</pubDate><description><![CDATA[我从18年辞职考研。
第一年考浙大计科361分，因一心想去计科，放弃工程师学院和软件学院的调剂面试。
第二年考浙大计科402分，面试被刷。
第三年考北大软微397分，成功上岸。
之后有时间会补充下细节。

...]]></description><category></category></item><item><title><![CDATA[778-Swim in Rising Water]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80588022</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80588022</guid><author>LaputaFallen</author><pubDate>Wed, 06 Jun 2018 21:46:17 +0800</pubDate><description><![CDATA[Description

On an N x N grid, each square grid[i][j] represents the elevation at that point (i,j).

Now rain starts to fall. At time t, the depth of the water everywhere is t. You can swim from a squ...]]></description><category></category></item><item><title><![CDATA[130-Surrounded Regions]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80585146</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80585146</guid><author>LaputaFallen</author><pubDate>Tue, 05 Jun 2018 21:30:50 +0800</pubDate><description><![CDATA[Description

Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.

A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.



Example:
...]]></description><category></category></item><item><title><![CDATA[133-Clone Graph]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80584887</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80584887</guid><author>LaputaFallen</author><pubDate>Tue, 05 Jun 2018 17:48:14 +0800</pubDate><description><![CDATA[Description

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ’s undirected graph serialization: 
Nodes are labeled uniquely.

We use # as a separator...]]></description><category></category></item><item><title><![CDATA[332-Reconstruct Itinerary]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80525665</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80525665</guid><author>LaputaFallen</author><pubDate>Thu, 31 May 2018 15:56:46 +0800</pubDate><description><![CDATA[Description

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from ...]]></description><category></category></item><item><title><![CDATA[210-Course Schedule II]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80513370</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80513370</guid><author>LaputaFallen</author><pubDate>Thu, 31 May 2018 14:54:46 +0800</pubDate><description><![CDATA[Description

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 take course 1, which is expres...]]></description><category></category></item><item><title><![CDATA[542-01 Matrix]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80511552</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80511552</guid><author>LaputaFallen</author><pubDate>Wed, 30 May 2018 16:03:58 +0800</pubDate><description><![CDATA[Description

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

The distance between two adjacent cells is 1.



Example 1: 

Input:



0 0 0
0 1 0
0 0 0

Output:

...]]></description><category></category></item><item><title><![CDATA[721-Accounts Merge]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80510141</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80510141</guid><author>LaputaFallen</author><pubDate>Wed, 30 May 2018 14:56:57 +0800</pubDate><description><![CDATA[Description

Given a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the ...]]></description><category></category></item><item><title><![CDATA[417-Pacific Atlantic Water Flow]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80508839</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80508839</guid><author>LaputaFallen</author><pubDate>Wed, 30 May 2018 13:35:09 +0800</pubDate><description><![CDATA[Description

Given an m x n matrix of non-negative integers representing the height of each unit cell in a continent, the “Pacific ocean” touches the left and top edges of the matrix and the “Atlantic...]]></description><category></category></item><item><title><![CDATA[473-Matchsticks to Square]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80490202</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80490202</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 23:14:04 +0800</pubDate><description><![CDATA[Description

Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchstic...]]></description><category></category></item><item><title><![CDATA[200-Number of Islands]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80490030</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80490030</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 22:55:00 +0800</pubDate><description><![CDATA[Description

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 connecting adjacent lands horizontally or vertically. Y...]]></description><category></category></item><item><title><![CDATA[802-Find Eventual Safe States]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80489974</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80489974</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 22:49:27 +0800</pubDate><description><![CDATA[Description

In a directed graph, we start at some node and every turn, walk along a directed edge of the graph.  If we reach a node that is terminal (that is, it has no outgoing directed edges), we s...]]></description><category></category></item><item><title><![CDATA[785-Is Graph Bipartite?]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80489674</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80489674</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 22:19:47 +0800</pubDate><description><![CDATA[Description

Given an undirected graph, return true if and only if it is bipartite.

Recall that a graph is bipartite if we can split it’s set of nodes into two independent subsets A and B such that e...]]></description><category></category></item><item><title><![CDATA[491-Increasing Subsequences]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80489385</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80489385</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 21:55:25 +0800</pubDate><description><![CDATA[Description

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .



E...]]></description><category></category></item><item><title><![CDATA[547-Friend Circles]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80485839</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80485839</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 17:47:06 +0800</pubDate><description><![CDATA[Description

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 friend of B, and B is a direct frien...]]></description><category></category></item><item><title><![CDATA[529-Minesweeper]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80484806</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80484806</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 17:01:56 +0800</pubDate><description><![CDATA[Description

Let’s play the minesweeper game (Wikipedia, online game)!

You are given a 2D char matrix representing the game board. ‘M’ represents an unrevealed mine, ‘E’ represents an unrevealed empt...]]></description><category></category></item><item><title><![CDATA[733-Flood Fill]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80483744</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80483744</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 16:09:44 +0800</pubDate><description><![CDATA[Description

An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).

Given a coordinate (sr, sc) representing the starting pixel ...]]></description><category></category></item><item><title><![CDATA[145-Binary Tree Postorder Traversal]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80483508</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80483508</guid><author>LaputaFallen</author><pubDate>Mon, 28 May 2018 15:57:06 +0800</pubDate><description><![CDATA[Description

Given a binary tree, return the postorder traversal of its nodes’ values.



Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [3,2,1]

Follow up: Recursive solution is ...]]></description><category></category></item><item><title><![CDATA[98-Validate Binary Search Tree]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80451881</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80451881</guid><author>LaputaFallen</author><pubDate>Fri, 25 May 2018 14:59:26 +0800</pubDate><description><![CDATA[Description

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:


The left subtree of a node contains only nodes with keys less than the nod...]]></description><category></category></item><item><title><![CDATA[236-Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.csdn.net/LaputaFallen/article/details/80451648</link><guid>https://blog.csdn.net/LaputaFallen/article/details/80451648</guid><author>LaputaFallen</author><pubDate>Fri, 25 May 2018 14:45:47 +0800</pubDate><description><![CDATA[Description

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: “The lowest common ancestor is defined between...]]></description><category></category></item></channel></rss>