<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[reigns的博客]]></title><description><![CDATA[随便写写]]></description><link>https://blog.youkuaiyun.com/reigns_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; reigns_]]></copyright><item><title><![CDATA[LeetCode-1488. Avoid Flood in The City]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/107072831</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/107072831</guid><author>reigns_</author><pubDate>Wed, 01 Jul 2020 22:03:37 +0800</pubDate><description><![CDATA[Your country has an infinite number of lakes. Initially, all the lakes are empty, but when it rains over thenthlake, thenthlake becomes full of water. If it rains over a lake which isfull of water, there will be aflood. Your goal is to avoid the floo...]]></description><category></category></item><item><title><![CDATA[LeetCode-1487. Making File Names Unique]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/107072716</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/107072716</guid><author>reigns_</author><pubDate>Wed, 01 Jul 2020 21:46:31 +0800</pubDate><description><![CDATA[Given an array of stringsnamesof sizen. You will createnfolders in your file systemsuch that, at theithminute, you will create a folder with the namenames[i].

Since two filescannothave the same name, if you enter a folder name which is previous...]]></description><category></category></item><item><title><![CDATA[grin中pow算法-cuckoo cycle的lean算法简单分析]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/105363154</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/105363154</guid><author>reigns_</author><pubDate>Wed, 06 May 2020 20:50:37 +0800</pubDate><description><![CDATA[最近实习，接触了一个比较新颖的工作量证明算法：cuckoo-cycle，基本原理是在一个极大二分图中找到一个长度为proofsize的回路。

算法介绍在网上都有，就不赘述了：https://www.zuocoin.com/a/news/experience/2019/0401/32897.html

讲讲具体的算法细节吧：

1.二分图的生成

这是一个基于图的pow算法，当然需要生成一个初始化...]]></description><category></category></item><item><title><![CDATA[渣硕2020暑期实习面经]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/105956729</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/105956729</guid><author>reigns_</author><pubDate>Wed, 06 May 2020 18:38:41 +0800</pubDate><description><![CDATA[春招也结束了，拿了点offer，因为一开始就没有准备找区块链方向岗位，所以准备的还是研发岗。

因为面的比较少，大厂就面了BATD，所以手上的offer并不多：滴滴、腾讯、阿里还有一家创业公司。过程还算顺利，然后拿了offer也就没有再面其他家了，懒=_=。



千芯科技-区块链算法实习生

面试就一轮，面完了很快就发offer了，也是实习到现在的公司。一家清华系创业公司，做AI、区块链芯片的，...]]></description><category></category></item><item><title><![CDATA[LeetCode-1344. Jump Game V]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104151362</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104151362</guid><author>reigns_</author><pubDate>Mon, 03 Feb 2020 01:29:53 +0800</pubDate><description><![CDATA[Given an array ofintegersarrand an integerd. In one step you can jump from indexito index:

i + xwhere:i + x &lt; arr.lengthand0 &lt;x &lt;= d.
	i - xwhere:i - x &gt;= 0and0 &lt;x &lt;...]]></description><category></category></item><item><title><![CDATA[LeetCode-1343. Maximum Product of Splitted Binary Tree]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104151347</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104151347</guid><author>reigns_</author><pubDate>Mon, 03 Feb 2020 01:08:38 +0800</pubDate><description><![CDATA[Given a binary treeroot.Split the binary tree into two subtrees by removing1 edge such that the product of the sums of the subtrees are maximized.

Since the answermay be too large,return it modu...]]></description><category></category></item><item><title><![CDATA[LeetCode-1342. Reduce Array Size to The Half]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104151341</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104151341</guid><author>reigns_</author><pubDate>Mon, 03 Feb 2020 01:00:26 +0800</pubDate><description><![CDATA[Given an arrayarr. You can choose a set of integers and remove all the occurrences of these integers in the array.

Returnthe minimum size of the setso thatat leasthalf of the integers of the ar...]]></description><category></category></item><item><title><![CDATA[LeetCode-1341. The K Weakest Rows in a Matrix]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104151338</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104151338</guid><author>reigns_</author><pubDate>Mon, 03 Feb 2020 00:59:19 +0800</pubDate><description><![CDATA[Given am* nmatrixmatofones(representing soldiers) andzeros(representing civilians), return the indexes of thekweakest rows in the matrix ordered from the weakest to the strongest.

A rowi...]]></description><category></category></item><item><title><![CDATA[LeetCode-1326. Minimum Number of Taps to Open to Water a Garden]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104140026</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104140026</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:25:10 +0800</pubDate><description><![CDATA[There is a one-dimensional garden on the x-axis. The garden starts at the point0and ends at the pointn. (i.e The length of the garden isn).

There aren + 1taps locatedat points[0, 1, ..., n]i...]]></description><category></category></item><item><title><![CDATA[LeetCode-1325. Delete Leaves With a Given Value]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104140021</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104140021</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:16:16 +0800</pubDate><description><![CDATA[Given a binary treerootand an integertarget, delete all theleaf nodeswith valuetarget.

Notethat once you delete a leaf node with valuetarget,if it's parent node becomes a leaf node and has t...]]></description><category></category></item><item><title><![CDATA[LeetCode-1324. Print Words Vertically]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104140017</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104140017</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:14:48 +0800</pubDate><description><![CDATA[Given a strings.Returnall the words vertically in the same order in which they appear ins.
Words are returned as a list of strings, complete withspaces when is necessary. (Trailing spaces are not...]]></description><category></category></item><item><title><![CDATA[LeetCode-1323. Maximum 69 Number]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104140012</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104140012</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:12:59 +0800</pubDate><description><![CDATA[Given a positive integernumconsisting only of digits 6 and 9.

Return the maximum number you can get by changingat mostone digit (6 becomes 9, and 9 becomes 6).



Example 1:


Input: num = 9669
...]]></description><category></category></item><item><title><![CDATA[LeetCode-1319. Number of Operations to Make Network Connected]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104139987</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104139987</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:10:54 +0800</pubDate><description><![CDATA[There arencomputers numbered from0ton-1connected byethernet cablesconnectionsforming a network whereconnections[i] = [a, b]represents a connection between computersaandb. Any computerca...]]></description><category></category></item><item><title><![CDATA[LeetCode-1318. Minimum Flips to Make a OR b Equal to c]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104139986</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104139986</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:06:04 +0800</pubDate><description><![CDATA[Given 3 positives numbersa,bandc. Return the minimum flips required in some bits ofaandbto make (aORb==c). (bitwise OR operation).
Flip operationconsists of changeanysingle bit 1 to 0...]]></description><category></category></item><item><title><![CDATA[LeetCode-1317. Convert Integer to the Sum of Two No-Zero Integers]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104139983</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104139983</guid><author>reigns_</author><pubDate>Sun, 02 Feb 2020 00:05:10 +0800</pubDate><description><![CDATA[Given an integern. No-Zero integer is a positive integer whichdoesn't contain any 0in its decimal representation.

Returna list of two integers[A, B]where:

AandBare No-Zero integers.
	A + B ...]]></description><category></category></item><item><title><![CDATA[LeetCode-1306. Jump Game III]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104119982</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104119982</guid><author>reigns_</author><pubDate>Thu, 30 Jan 2020 22:49:55 +0800</pubDate><description><![CDATA[Given an array of non-negative integersarr, you are initially positioned atstartindex of the array. When you are at indexi, you can jumptoi + arr[i]ori - arr[i], check if you can reach toany...]]></description><category></category></item><item><title><![CDATA[LeetCode-1305. All Elements in Two Binary Search Trees]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104119970</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104119970</guid><author>reigns_</author><pubDate>Thu, 30 Jan 2020 22:47:20 +0800</pubDate><description><![CDATA[Given two binary search treesroot1androot2.

Return a list containingall the integersfromboth treessorted inascendingorder.



Example 1:




Input: root1 = [2,1,4], root2 = [1,0,3]
Output: ...]]></description><category></category></item><item><title><![CDATA[LeetCode-1304. Find N Unique Integers Sum up to Zero]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104119861</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104119861</guid><author>reigns_</author><pubDate>Thu, 30 Jan 2020 22:35:15 +0800</pubDate><description><![CDATA[Given an integern, returnanyarray containingnuniqueintegers such that they add up to 0.



Example 1:


Input: n = 5
Output: [-7,-1,1,3,4]
Explanation: These arrays also are accepted [-5,-1,1,2...]]></description><category></category></item><item><title><![CDATA[LeetCode-797. All Paths From Source to Target]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104118884</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104118884</guid><author>reigns_</author><pubDate>Thu, 30 Jan 2020 20:59:49 +0800</pubDate><description><![CDATA[Given a directed, acyclic graph ofNnodes. Find all possible paths from node0to nodeN-1, and return them in any order.

The graph is given as follows: the nodes are 0, 1, ..., graph.length - 1....]]></description><category></category></item><item><title><![CDATA[LeetCode-1311. Get Watched Videos by Your Friends]]></title><link>https://blog.youkuaiyun.com/reigns_/article/details/104106548</link><guid>https://blog.youkuaiyun.com/reigns_/article/details/104106548</guid><author>reigns_</author><pubDate>Wed, 29 Jan 2020 14:08:37 +0800</pubDate><description><![CDATA[There arenpeople, each person has a uniqueidbetween0andn-1. Given the arrayswatchedVideosandfriends, wherewatchedVideos[i]andfriends[i]contain the list of watched videos and the list of ...]]></description><category></category></item></channel></rss>