<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Frontier_Setter的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Frontier_Setter</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Frontier_Setter]]></copyright><item><title><![CDATA[数据压缩常用算法汇总（思维导图）]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/105001051</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/105001051</guid><author>Frontier_Setter</author><pubDate>Fri, 20 Mar 2020 23:05:33 +0800</pubDate><description><![CDATA[参考：《数据压缩导论》第2-6章

包括霍夫曼编码、算术编码、词典方法和基于上下文的压缩




]]></description><category></category></item><item><title><![CDATA[关于知识与情景的抽象]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/102648422</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/102648422</guid><author>Frontier_Setter</author><pubDate>Sun, 20 Oct 2019 14:17:59 +0800</pubDate><description><![CDATA[这两天阅读了《程序员的思维训练》和《暗时间》两书，其中不约而同地提到了抽象这个概念，也就是说我们在学习的过程中将知识抽象，然后在遇到问题的时候将问题抽象，利用抽象出来的这部分去匹配从而实现大脑中“海量数据”的搜索匹配，很多时候我们没法想到解决问题的方法、没法做到学以致用或者由此及彼可能就是由于对知识的抽象不够，没有发现知识点的核心——表现出来就是死读书，也有可能是对问题的抽象不够，没有发现问题的本...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (Hard) 685. Redundant Connection II]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/93196085</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/93196085</guid><author>Frontier_Setter</author><pubDate>Fri, 21 Jun 2019 15:29:03 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/redundant-connection-ii/


In this problem, a rooted tree is adirectedgraph such that, there is exactly one node (the root) for which all other nodes are descendants of...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (hard) 218. The Skyline Problem]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90904978</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90904978</guid><author>Frontier_Setter</author><pubDate>Wed, 05 Jun 2019 16:47:12 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/the-skyline-problem/


A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you areg...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (hard) 140. Word Break II]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90754456</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90754456</guid><author>Frontier_Setter</author><pubDate>Mon, 03 Jun 2019 16:36:46 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/word-break-ii/


Given anon-emptystringsand a dictionarywordDictcontaining a list ofnon-emptywords, add spaces insto construct a sentence where each word is a va...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (hard) 10. Regular Expression Matching && 44. Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90741668</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90741668</guid><author>Frontier_Setter</author><pubDate>Sun, 02 Jun 2019 18:16:10 +0800</pubDate><description><![CDATA[10.Regular Expression Matching


Given an input string (s) and a pattern (p), implement regular expression matching with support for'.'and'*'.


'.' Matches any single character.
'*' Matches zero ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 692. Top K Frequent Words]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90723950</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90723950</guid><author>Frontier_Setter</author><pubDate>Fri, 31 May 2019 22:30:19 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/top-k-frequent-words/


Given a non-empty list of words, return thekmost frequent elements.

Your answer should be sorted by frequency from highest to lowest. If two wo...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 688. Knight Probability in Chessboard]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90723580</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90723580</guid><author>Frontier_Setter</author><pubDate>Fri, 31 May 2019 22:00:16 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/knight-probability-in-chessboard/


On anNxNchessboard, a knight starts at ther-th row andc-th column and attempts to make exactlyKmoves. The rows and columns are 0...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 684. Redundant Connection]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90714710</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90714710</guid><author>Frontier_Setter</author><pubDate>Fri, 31 May 2019 13:41:27 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/redundant-connection/


In this problem, a tree is anundirectedgraph that is connected and has no cycles.

The given input is a graph that started as a tree with N node...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 678. Valid Parenthesis String]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90713996</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90713996</guid><author>Frontier_Setter</author><pubDate>Fri, 31 May 2019 12:13:35 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/valid-parenthesis-string/


Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 673. Number of Longest Increasing Subsequence]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90712967</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90712967</guid><author>Frontier_Setter</author><pubDate>Fri, 31 May 2019 11:17:55 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/number-of-longest-increasing-subsequence/


Given an unsorted array of integers, find the number of longest increasing subsequence.

Example 1:


Input: [1,3,5,4,7]
Outpu...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 672. Bulb Switcher II]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90701253</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90701253</guid><author>Frontier_Setter</author><pubDate>Thu, 30 May 2019 17:22:08 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/bulb-switcher-ii/


There is a room withnlights which are turned on initially and 4 buttons on the wall. After performing exactlymunknown operations towards buttons, y...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 667. Beautiful Arrangement II]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90694619</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90694619</guid><author>Frontier_Setter</author><pubDate>Thu, 30 May 2019 11:51:38 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/beautiful-arrangement-ii/


Given two integersnandk, you need to construct a list which containsndifferent positive integers ranging from1tonand obeys the follow...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 659. Split Array into Consecutive Subsequences]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90668852</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90668852</guid><author>Frontier_Setter</author><pubDate>Wed, 29 May 2019 12:35:58 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/split-array-into-consecutive-subsequences/


You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subseq...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 658. Find K Closest Elements]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90667673</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90667673</guid><author>Frontier_Setter</author><pubDate>Wed, 29 May 2019 11:19:11 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/find-k-closest-elements/


Given a sorted array, two integerskandx, find thekclosest elements toxin the array. The result should also be sorted in ascending order. ...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 654. Maximum Binary Tree]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90648069</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90648069</guid><author>Frontier_Setter</author><pubDate>Tue, 28 May 2019 22:03:23 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/maximum-binary-tree/


Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

The root is the maximum number in the array...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 650. 2 Keys Keyboard]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90614146</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90614146</guid><author>Frontier_Setter</author><pubDate>Mon, 27 May 2019 23:29:36 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/2-keys-keyboard/


Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:

Copy All: You can copy all the...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 611. Valid Triangle Number]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90484227</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90484227</guid><author>Frontier_Setter</author><pubDate>Thu, 23 May 2019 17:14:24 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/valid-triangle-number/


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 w...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 593. Valid Square]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90483522</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90483522</guid><author>Frontier_Setter</author><pubDate>Thu, 23 May 2019 16:48:01 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/valid-square/


Given the coordinates of four points in 2D space, return whether the four points could construct a square.

The coordinate (x,y) of a point is represented...]]></description><category></category></item><item><title><![CDATA[[LeetCode] (medium) 523. Continuous Subarray Sum]]></title><link>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90349444</link><guid>https://blog.youkuaiyun.com/Frontier_Setter/article/details/90349444</guid><author>Frontier_Setter</author><pubDate>Sun, 19 May 2019 22:53:56 +0800</pubDate><description><![CDATA[https://leetcode.com/problems/continuous-subarray-sum/


Given a list ofnon-negativenumbers and a targetintegerk, write a function to check if the array has a continuous subarray of size at least ...]]></description><category></category></item></channel></rss>