<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a0712104790的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a0712104790</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a0712104790]]></copyright><item><title><![CDATA[浅谈《过气堡垒》，一个RTS玩家的视角]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718485</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718485</guid><author>a0712104790</author><pubDate>Mon, 23 Sep 2019 22:05:00 +0800</pubDate><description><![CDATA[这次主要想谈一谈《上海堡垒》这个电影
我并没有去电影院看这片，主要原因是，我知道这个片的时候它已经下架了。
我主要想从一个RTS玩家的视角去谈。我并非一个严格的RTS玩家，我只喜欢RA3，命令与征服系列罢了
《上海堡垒》这电影槽点有多少，实在是吐不完的地步，我也不在去赘述了。
就讲一讲它在“战略”这个层面的一些观点吧。
首先我们理一下敌我双方的战力
我方：自走行火炮，上海大炮...]]></description><category></category></item><item><title><![CDATA[新的开始，新的计划]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718486</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718486</guid><author>a0712104790</author><pubDate>Tue, 17 Sep 2019 22:50:00 +0800</pubDate><description><![CDATA[写下这篇文章时，其实是我最近最浮躁的一段时间吧
既然是写给自己看的，就一切都实话实说吧，同时也想见证一下自己的成长
写这篇文章时，大四，收到BAT的意向书。已经咸鱼了一段时间了。
本来想在自己正式签完三方之后再去行动，这几天自己也放松的差不多了。也该开始为之后做一些打算了。就想具体的做一些计划之类的。不过具体列计划表之前，还是想记录一下自己这段时间的心情。
既复杂又难受。收到意向...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 54. Spiral Matrix]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718482</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718482</guid><author>a0712104790</author><pubDate>Sun, 11 Nov 2018 19:53:00 +0800</pubDate><description><![CDATA[Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.
Example 1:
Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output: [1,2,3,...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 40. Combination Sum II]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718483</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718483</guid><author>a0712104790</author><pubDate>Sun, 11 Nov 2018 18:45:00 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations incandidateswhere the candidate numbers sums totarget.
Each number incandi...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 611. Valid Triangle Number]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718480</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718480</guid><author>a0712104790</author><pubDate>Sat, 10 Nov 2018 23:02:00 +0800</pubDate><description><![CDATA[Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
Exampl...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 583. Delete Operation for Two Strings]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718477</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718477</guid><author>a0712104790</author><pubDate>Mon, 05 Nov 2018 21:06:00 +0800</pubDate><description><![CDATA[Given two wordsword1andword2, find the minimum number of steps required to makeword1andword2the same, where in each step you can delete one character in either string.
Example 1:
Input: ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 522. Longest Uncommon Subsequence II]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718479</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718479</guid><author>a0712104790</author><pubDate>Mon, 05 Nov 2018 21:00:00 +0800</pubDate><description><![CDATA[Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 240. Search a 2D Matrix II]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718475</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718475</guid><author>a0712104790</author><pubDate>Tue, 30 Oct 2018 19:02:00 +0800</pubDate><description><![CDATA[Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:

Integers in each row are sorted in ascending from left to right.
Integers ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 128. Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718476</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718476</guid><author>a0712104790</author><pubDate>Sun, 28 Oct 2018 11:31:00 +0800</pubDate><description><![CDATA[Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
Your algorithm should run in O(n) complexity.
Example:
Input:[100, 4, 200, 1, 3, 2]
Output:...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 540. Single Element in a Sorted Array]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718472</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718472</guid><author>a0712104790</author><pubDate>Sat, 20 Oct 2018 22:43:00 +0800</pubDate><description><![CDATA[Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.
Example 1:
Input: ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 69. Sqrt(x)]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718470</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718470</guid><author>a0712104790</author><pubDate>Sat, 20 Oct 2018 22:35:00 +0800</pubDate><description><![CDATA[Implementint sqrt(int x).
Compute and return the square root ofx, wherexis guaranteed to be a non-negative integer.
Since the return typeis an integer, the decimal digits are truncated and...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 524. Longest Word in Dictionary through Deleting]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718473</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718473</guid><author>a0712104790</author><pubDate>Sat, 20 Oct 2018 22:30:00 +0800</pubDate><description><![CDATA[Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 763. Partition Labels]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718468</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718468</guid><author>a0712104790</author><pubDate>Sat, 20 Oct 2018 22:26:00 +0800</pubDate><description><![CDATA[A stringSof 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 representi...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 189. Rotate Array]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718471</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718471</guid><author>a0712104790</author><pubDate>Wed, 17 Oct 2018 22:42:00 +0800</pubDate><description><![CDATA[Given an array, rotate the array to the right byksteps, wherekis non-negative.
Example 1:
Input: [1,2,3,4,5,6,7] and k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the righ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 378. Kth Smallest Element in a Sorted Matrix]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718465</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718465</guid><author>a0712104790</author><pubDate>Tue, 16 Oct 2018 20:12:00 +0800</pubDate><description><![CDATA[Given anxnmatrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.
Note that it is the kth smallest element in the sorted order, ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 35. Search Insert Position]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718469</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718469</guid><author>a0712104790</author><pubDate>Mon, 15 Oct 2018 21:39:00 +0800</pubDate><description><![CDATA[Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the arr...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 347. Top K Frequent Elements]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718462</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718462</guid><author>a0712104790</author><pubDate>Sun, 14 Oct 2018 22:28:00 +0800</pubDate><description><![CDATA[Given a non-empty array of integers, return thekmost frequent elements.
Example 1:
Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]


Example 2:
Input: nums = [1], k = 1
Output: [1]

...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 238. Product of Array Except Self]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718466</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718466</guid><author>a0712104790</author><pubDate>Sun, 14 Oct 2018 10:57:00 +0800</pubDate><description><![CDATA[Given an arraynumsofnintegers wheren&gt; 1, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].
Example:
Input:  [1,2,3,4]
Out...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 572. Subtree of Another Tree]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718459</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718459</guid><author>a0712104790</author><pubDate>Sun, 14 Oct 2018 10:33:00 +0800</pubDate><description><![CDATA[Given two non-empty binary treessandt, check whether treethas exactly the same structure and node values with a subtree ofs. A subtree ofsis a tree consists of a node insand all of this...]]></description><category></category></item><item><title><![CDATA[[LeetCode] 538. Convert BST to Greater Tree]]></title><link>https://blog.youkuaiyun.com/a0712104790/article/details/101718417</link><guid>https://blog.youkuaiyun.com/a0712104790/article/details/101718417</guid><author>a0712104790</author><pubDate>Sat, 13 Oct 2018 21:56:00 +0800</pubDate><description><![CDATA[Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
E...]]></description><category></category></item></channel></rss>