<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[snailrunfast的博客 https://segmentfault.com/u/snailrunfast]]></title><description><![CDATA[https://segmentfault.com/u/snailrunfast]]></description><link>https://blog.youkuaiyun.com/snailrunfast</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; snailrunfast]]></copyright><item><title><![CDATA[208. Implement Trie (Prefix Tree)]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86661920</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86661920</guid><author>snailrunfast</author><pubDate>Sat, 26 Jan 2019 22:17:36 +0800</pubDate><description><![CDATA[208. Implement Trie (Prefix Tree)

Medium

Implement a trie with insert, search, and startsWith methods.

Example:


Trie trie = new Trie();

trie.insert(&quot;apple&quot;);
trie.search(&quot;apple&quot;);   // returns t...]]></description><category></category></item><item><title><![CDATA[201. Bitwise AND of Numbers Range]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86631556</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86631556</guid><author>snailrunfast</author><pubDate>Thu, 24 Jan 2019 18:45:47 +0800</pubDate><description><![CDATA[201. Bitwise AND of Numbers Range

Medium

Given a range [m, n] where 0 &amp;lt;= m &amp;lt;= n &amp;lt;= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

Example 1:


Input: [5,7]
Out...]]></description><category></category></item><item><title><![CDATA[200. Number of Islands]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86629225</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86629225</guid><author>snailrunfast</author><pubDate>Thu, 24 Jan 2019 16:33:07 +0800</pubDate><description><![CDATA[200. Number of Islands

Medium

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 horizontal...]]></description><category></category></item><item><title><![CDATA[596. Classes More Than 5 Students]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86622394</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86622394</guid><author>snailrunfast</author><pubDate>Thu, 24 Jan 2019 10:46:29 +0800</pubDate><description><![CDATA[596. Classes More Than 5 Students

Easy

132344FavoriteShare

SQL Schema

There is a table courses with columns: student and class

Please list out all classes which have more than or equal to 5 stude...]]></description><category></category></item><item><title><![CDATA[626. Exchange Seats]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86622362</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86622362</guid><author>snailrunfast</author><pubDate>Thu, 24 Jan 2019 10:44:56 +0800</pubDate><description><![CDATA[626. Exchange Seats

Medium

135126FavoriteShare

SQL Schema

Mary is a teacher in a middle school and she has a table seat storing students' names and their corresponding seat ids.

The column id is ...]]></description><category></category></item><item><title><![CDATA[262. Trips and Users]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86622300</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86622300</guid><author>snailrunfast</author><pubDate>Thu, 24 Jan 2019 10:43:10 +0800</pubDate><description><![CDATA[262. Trips and Users

Hard

158116FavoriteShare

SQL Schema

The Trips table holds all taxi trips. Each trip has a unique Id, while Client_Id and Driver_Id are both foreign keys to the Users_Id at the...]]></description><category></category></item><item><title><![CDATA[142. Linked List Cycle II]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86591891</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86591891</guid><author>snailrunfast</author><pubDate>Tue, 22 Jan 2019 11:33:20 +0800</pubDate><description><![CDATA[142. Linked List Cycle II

Medium

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

To represent a cycle in the given linked list, we use an integer pos...]]></description><category></category></item><item><title><![CDATA[173. Binary Search Tree Iterator]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86591470</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86591470</guid><author>snailrunfast</author><pubDate>Tue, 22 Jan 2019 11:16:15 +0800</pubDate><description><![CDATA[173. Binary Search Tree Iterator

Medium

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Calling next() will return the next sma...]]></description><category></category></item><item><title><![CDATA[892. Surface Area of 3D Shapes]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86525062</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86525062</guid><author>snailrunfast</author><pubDate>Thu, 17 Jan 2019 15:18:02 +0800</pubDate><description><![CDATA[892. Surface Area of 3D Shapes

Easy

On a N * N grid, we place some 1 * 1 * 1 cubes.

Each value v = grid[i][j] represents a tower of v cubes placed on top of grid cell (i, j).

Return the total surf...]]></description><category></category></item><item><title><![CDATA[162. Find Peak Element]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86519818</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86519818</guid><author>snailrunfast</author><pubDate>Thu, 17 Jan 2019 10:45:59 +0800</pubDate><description><![CDATA[162. Find Peak Element

Medium

6561047FavoriteShare

A peak element is an element that is greater than its neighbors.

Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and re...]]></description><category></category></item><item><title><![CDATA[165. Compare Version Numbers]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86516878</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86516878</guid><author>snailrunfast</author><pubDate>Thu, 17 Jan 2019 00:00:21 +0800</pubDate><description><![CDATA[165. Compare Version Numbers

Medium

223973FavoriteShare

Compare two version numbers version1 and version2.
If version1 &amp;gt; version2 return 1; if version1 &amp;lt;version2 return -1;otherwise return 0....]]></description><category></category></item><item><title><![CDATA[187. Repeated DNA Sequences]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86516351</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86516351</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 22:53:21 +0800</pubDate><description><![CDATA[187. Repeated DNA Sequences

Medium

358142FavoriteShare

All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: &quot;ACGAATTCCG&quot;. When studying DNA, it is sometimes us...]]></description><category></category></item><item><title><![CDATA[209. Minimum Size Subarray Sum]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86511809</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86511809</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 17:40:21 +0800</pubDate><description><![CDATA[209. Minimum Size Subarray Sum

Medium

87660FavoriteShare

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If th...]]></description><category></category></item><item><title><![CDATA[153. Find Minimum in Rotated Sorted Array]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86507201</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86507201</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 14:32:27 +0800</pubDate><description><![CDATA[153. Find Minimum in Rotated Sorted Array

Medium

751133FavoriteShare

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e.,  [0,1,2,4,5,6,7] might be...]]></description><category></category></item><item><title><![CDATA[150. Evaluate Reverse Polish Notation]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86506578</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86506578</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 14:01:56 +0800</pubDate><description><![CDATA[150. Evaluate Reverse Polish Notation

Medium

414303FavoriteShare

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an i...]]></description><category></category></item><item><title><![CDATA[260. Single Number III]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86505774</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86505774</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 12:56:58 +0800</pubDate><description><![CDATA[260. Single Number III

Medium

69566FavoriteShare

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two element...]]></description><category></category></item><item><title><![CDATA[147. Insertion Sort List]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86504255</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86504255</guid><author>snailrunfast</author><pubDate>Wed, 16 Jan 2019 11:06:54 +0800</pubDate><description><![CDATA[147. Insertion Sort List

Medium

274332FavoriteShare

Sort a linked list using insertion sort.


A graphical example of insertion sort. The partial sorted list (black) initially contains only the fir...]]></description><category></category></item><item><title><![CDATA[143. Reorder List]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86500953</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86500953</guid><author>snailrunfast</author><pubDate>Tue, 15 Jan 2019 23:34:03 +0800</pubDate><description><![CDATA[143. Reorder List

Medium

66755FavoriteShare

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You may not modify the values in the list's nodes, only nodes itse...]]></description><category></category></item><item><title><![CDATA[137. Single Number II]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/86498881</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/86498881</guid><author>snailrunfast</author><pubDate>Tue, 15 Jan 2019 20:43:07 +0800</pubDate><description><![CDATA[137. Single Number II

Medium

655224FavoriteShare

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.

Note:

You...]]></description><category></category></item><item><title><![CDATA[138. Copy List with Random Pointer]]></title><link>https://blog.youkuaiyun.com/snailrunfast/article/details/85217806</link><guid>https://blog.youkuaiyun.com/snailrunfast/article/details/85217806</guid><author>snailrunfast</author><pubDate>Sat, 22 Dec 2018 20:46:33 +0800</pubDate><description><![CDATA[138. Copy List with Random Pointer

Medium

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of t...]]></description><category></category></item></channel></rss>