<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MrJustin的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MrJustin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MrJustin]]></copyright><item><title><![CDATA[LeetCode1466. Reorder Routes to Make All Paths Lead to the City Zero]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106465127</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106465127</guid><author>MrJustin</author><pubDate>Mon, 01 Jun 2020 07:03:45 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1466. Reorder Routes to Make All Paths Lead to the City Zero
链接: https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/
题目描述：
There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one]]></description><category></category></item><item><title><![CDATA[LeetCode 72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106465074</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106465074</guid><author>MrJustin</author><pubDate>Mon, 01 Jun 2020 04:58:20 +0800</pubDate><description><![CDATA[[Hard]  LeetCode 72. Edit Distance
链接: https://leetcode.com/problems/edit-distance/
题目描述：
Given two words word1 and word2, find the minimum number of operations
required to convert word1 to word2.
You have the following 3 operations permitted on a word:

I]]></description><category></category></item><item><title><![CDATA[LeetCode 973. K Closest Points to Origin]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106464272</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106464272</guid><author>MrJustin</author><pubDate>Mon, 01 Jun 2020 00:21:24 +0800</pubDate><description><![CDATA[[Med]  LeetCode 973. K Closest Points to Origin
链接: https://leetcode.com/submissions/detail/206164544/
题目描述：
We have a list of points on the plane.  Find the K closest points to the origin (0, 0).
(Here, the distance between two points on a plane is the Eu]]></description><category></category></item><item><title><![CDATA[LeetCode 1035. Uncrossed Lines]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106346591</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106346591</guid><author>MrJustin</author><pubDate>Tue, 26 May 2020 02:48:46 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1035. Uncrossed Lines
链接:  https://leetcode.com/problems/uncrossed-lines/
题目描述：
We write the integers of A and B (in the order they are given) on two separate horizontal lines.
Now, we may draw connecting lines: a straight line connecting t]]></description><category></category></item><item><title><![CDATA[LeetCode 1426 Counting Elements]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106324914</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106324914</guid><author>MrJustin</author><pubDate>Mon, 25 May 2020 01:54:25 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1426 Counting Elements
链接:
题目描述：
Given an integer array arr, count element x such that x + 1 is also in arr.
If there’re duplicates in arr, count them seperately.
Example 1:

Input: arr = [1,2,3]
Output: 2
Explanation: 1 and 2 are counted c]]></description><category></category></item><item><title><![CDATA[LeetCode 1427: Perform String Shifts]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106324903</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106324903</guid><author>MrJustin</author><pubDate>Mon, 25 May 2020 01:51:36 +0800</pubDate><description><![CDATA[[Easy]  LeetCode 1427: Perform String Shifts
链接: https://leetcode.com/problems/perform-string-shifts/
题目描述：
You are given a string s containing lowercase English letters, and a matrix shift, where shift[i] = [direction, amount]:
direction can be 0 (for lef]]></description><category></category></item><item><title><![CDATA[LeetCode 1429. First Unique Number]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106324890</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106324890</guid><author>MrJustin</author><pubDate>Mon, 25 May 2020 01:46:43 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1429. First Unique Number
链接:
题目描述：
You have a queue of integers, you need to retrieve the first unique integer in the queue.
Implement the FirstUnique class:
FirstUnique(int[] nums) Initializes the object with the numbers in the queue.
int]]></description><category></category></item><item><title><![CDATA[LeetCode 459. Repeated Substring Pattern]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106324873</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106324873</guid><author>MrJustin</author><pubDate>Mon, 25 May 2020 01:35:29 +0800</pubDate><description><![CDATA[[Easy]  LeetCode 459. Repeated Substring Pattern
链接: https://leetcode.com/problems/repeated-substring-pattern/
题目描述：
Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together]]></description><category></category></item><item><title><![CDATA[LeetCode 986. Interval List Intersections]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106309573</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106309573</guid><author>MrJustin</author><pubDate>Sun, 24 May 2020 04:18:29 +0800</pubDate><description><![CDATA[[Med]  LeetCode 986. Interval List Intersections
链接: https://leetcode.com/problems/interval-list-intersections/
题目描述：
Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order.
Return the intersection of these two]]></description><category></category></item><item><title><![CDATA[LeetCode 1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106309559</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106309559</guid><author>MrJustin</author><pubDate>Sun, 24 May 2020 02:32:00 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
链接: https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/
题目描述：
Given a binary tree where each pa]]></description><category></category></item><item><title><![CDATA[LeetCode 1428. Leftmost Column with at Least a One]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/105672624</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/105672624</guid><author>MrJustin</author><pubDate>Sun, 24 May 2020 02:15:26 +0800</pubDate><description><![CDATA[[Med]  LeetCode (未知题号) Leftmost Column with at Least a One
链接:
题目描述：
(This problem is an interactive problem.)
A binary matrix means that all elements are 0 or 1. For each individual row of the matrix...]]></description><category></category></item><item><title><![CDATA[LeetCode 402. Remove K Digits]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106111392</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106111392</guid><author>MrJustin</author><pubDate>Thu, 14 May 2020 06:08:46 +0800</pubDate><description><![CDATA[[Med]  LeetCode 402. Remove K Digits
链接: https://leetcode.com/problems/remove-k-digits/
题目描述： Given a non-negative integer num represented as a string, remove k digits
from the number so that the new number is the smallest possible.
Example 1:

Input: num ]]></description><category></category></item><item><title><![CDATA[LeetCode 997. Find the Town Judge]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106045897</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106045897</guid><author>MrJustin</author><pubDate>Mon, 11 May 2020 01:11:12 +0800</pubDate><description><![CDATA[[Easy]  LeetCode 997. Find the Town Judge
链接: https://leetcode.com/problems/find-the-town-judge/
题目描述：
In a town, there are N people labelled from 1 to N.  There is a rumor that one of these people is secretly the town judge.
If the town judge exists, then]]></description><category></category></item><item><title><![CDATA[LeetCode 1433. Check If a String Can Break Another String]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106031507</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106031507</guid><author>MrJustin</author><pubDate>Mon, 11 May 2020 00:34:06 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1433. Check If a String Can Break Another String
链接:
题目描述：
Example 1:

Input: s1 = “abc”, s2 = “xya”
Output: true
Explanation: “ayx” is a permutation of s2=“xya” which can break to string “abc” which is a permutation of s1=“abc”.

Example 2]]></description><category></category></item><item><title><![CDATA[LeetCode 826. Most Profit Assigning Work]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106031308</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106031308</guid><author>MrJustin</author><pubDate>Sun, 10 May 2020 07:43:37 +0800</pubDate><description><![CDATA[[Med]  LeetCode 826. Most Profit Assigning Work
链接: https://leetcode.com/problems/most-profit-assigning-work/
题目描述：
We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is the profit of the ith job.
Now we have some workers. worker[i]]></description><category></category></item><item><title><![CDATA[LeetCode 367. Valid Perfect Square]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/106031294</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/106031294</guid><author>MrJustin</author><pubDate>Sun, 10 May 2020 06:57:34 +0800</pubDate><description><![CDATA[[Easy]  LeetCode 367. Valid Perfect Square
链接: https://leetcode.com/problems/valid-perfect-square/
题目描述：
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function]]></description><category></category></item><item><title><![CDATA[LeetCode 383. Ransom Note]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/105912202</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/105912202</guid><author>MrJustin</author><pubDate>Mon, 04 May 2020 04:10:27 +0800</pubDate><description><![CDATA[[Easy]  LeetCode 383. Ransom Note
链接: https://leetcode.com/problems/ransom-note/
题目描述：
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a funct...]]></description><category></category></item><item><title><![CDATA[Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/105885861</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/105885861</guid><author>MrJustin</author><pubDate>Sat, 02 May 2020 12:35:42 +0800</pubDate><description><![CDATA[[Med]  LeetCode Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
链接:
题目描述：
Given a binary tree where each path going from the root to any leaf form a valid sequence, che...]]></description><category></category></item><item><title><![CDATA[LeetCode 1143. Longest Common Subsequence]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/105780148</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/105780148</guid><author>MrJustin</author><pubDate>Sun, 26 Apr 2020 23:58:25 +0800</pubDate><description><![CDATA[[Med]  LeetCode 1143. Longest Common Subsequence
链接: https://leetcode.com/problems/longest-common-subsequence/
题目描述：
Given two strings text1 and text2, return the length of their longest common subseq...]]></description><category></category></item><item><title><![CDATA[LeetCode 855. Exam Room]]></title><link>https://blog.youkuaiyun.com/MrJustin/article/details/105744037</link><guid>https://blog.youkuaiyun.com/MrJustin/article/details/105744037</guid><author>MrJustin</author><pubDate>Sun, 26 Apr 2020 05:25:19 +0800</pubDate><description><![CDATA[[Med]  LeetCode 855. Exam Room
链接:  https://leetcode.com/problems/exam-room/
题目描述：
In an exam room, there are N seats in a single row, numbered 0, 1, 2, …, N-1.
When a student enters the room, they mu...]]></description><category></category></item></channel></rss>