<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[prayyojay的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/prayyojay</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; prayyojay]]></copyright><item><title><![CDATA[LeetCode 287. Find the Duplicate Number 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53116065</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53116065</guid><author>prayyojay</author><pubDate>Thu, 10 Nov 2016 15:16:02 +0800</pubDate><description><![CDATA[Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the dup]]></description><category></category></item><item><title><![CDATA[LeetCode 452. Minimum Number of Arrows to Burst Balloons 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53103252</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53103252</guid><author>prayyojay</author><pubDate>Wed, 09 Nov 2016 18:21:55 +0800</pubDate><description><![CDATA[here are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates donoor]]></description><category></category></item><item><title><![CDATA[LeetCode 453. Minimum Moves to Equal Array Elements 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53096482</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53096482</guid><author>prayyojay</author><pubDate>Wed, 09 Nov 2016 09:57:06 +0800</pubDate><description><![CDATA[Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.n]]></description><category></category></item><item><title><![CDATA[LeetCode 436. Find Right Interval 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53069650</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53069650</guid><author>prayyojay</author><pubDate>Mon, 07 Nov 2016 19:54:10 +0800</pubDate><description><![CDATA[Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.]]></description><category></category></item><item><title><![CDATA[LeetCode 436. Find Right Interval 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53009164</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53009164</guid><author>prayyojay</author><pubDate>Wed, 02 Nov 2016 16:25:59 +0800</pubDate><description><![CDATA[Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "righ]]></description><category></category></item><item><title><![CDATA[LeetCode 318. Maximum Product of Word Lengths 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53007401</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53007401</guid><author>prayyojay</author><pubDate>Wed, 02 Nov 2016 14:03:10 +0800</pubDate><description><![CDATA[Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters.]]></description><category></category></item><item><title><![CDATA[LeetCode 319. Bulb Switcher 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/53001090</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/53001090</guid><author>prayyojay</author><pubDate>Tue, 01 Nov 2016 21:34:35 +0800</pubDate><description><![CDATA[There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb]]></description><category></category></item><item><title><![CDATA[LeetCode 52. N-Queens II 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52950686</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52950686</guid><author>prayyojay</author><pubDate>Thu, 27 Oct 2016 22:22:23 +0800</pubDate><description><![CDATA[Follow up for N-Queens problem.
 Now, instead outputting board configurations, return the total number of distinct solutions.]]></description><category></category></item><item><title><![CDATA[LeetCode 12. Integer to Roman 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52945215</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52945215</guid><author>prayyojay</author><pubDate>Thu, 27 Oct 2016 14:04:35 +0800</pubDate><description><![CDATA[Given an integer, convert it to a roman numeral.]]></description><category></category></item><item><title><![CDATA[LeetCode 144. Binary Tree Preorder Traversal 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52926486</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52926486</guid><author>prayyojay</author><pubDate>Tue, 25 Oct 2016 19:55:21 +0800</pubDate><description><![CDATA[Given a binary tree, return the preorder traversal of its nodes' values.]]></description><category></category></item><item><title><![CDATA[LeetCode 378. Kth Smallest Element in a Sorted Matrix 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52916227</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52916227</guid><author>prayyojay</author><pubDate>Mon, 24 Oct 2016 22:08:43 +0800</pubDate><description><![CDATA[Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.]]></description><category></category></item><item><title><![CDATA[LeetCode 206. Reverse Linked List 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52902502</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52902502</guid><author>prayyojay</author><pubDate>Sun, 23 Oct 2016 16:18:19 +0800</pubDate><description><![CDATA[Reverse a singly linked list.]]></description><category></category></item><item><title><![CDATA[LeetCode 13. Roman to Integer 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52900528</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52900528</guid><author>prayyojay</author><pubDate>Sun, 23 Oct 2016 11:00:30 +0800</pubDate><description><![CDATA[Given a roman numeral, convert it to an integer.]]></description><category></category></item><item><title><![CDATA[LeetCode 94. Binary Tree Inorder Traversal 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52892448</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52892448</guid><author>prayyojay</author><pubDate>Sat, 22 Oct 2016 15:13:42 +0800</pubDate><description><![CDATA[Given a binary tree, return the inorder traversal of its nodes' values.]]></description><category></category></item><item><title><![CDATA[LeetCode 401. Binary Watch 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52883187</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52883187</guid><author>prayyojay</author><pubDate>Fri, 21 Oct 2016 14:48:03 +0800</pubDate><description><![CDATA[LeetCode 401. Binary Watch 题解（C++）题目描述
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).
Each LED represents a zero or on]]></description><category></category></item><item><title><![CDATA[LeetCode 268. Missing Number 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52871229</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52871229</guid><author>prayyojay</author><pubDate>Thu, 20 Oct 2016 12:13:54 +0800</pubDate><description><![CDATA[Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.]]></description><category></category></item><item><title><![CDATA[LeetCode 350. Intersection of Two Arrays II 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52869606</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52869606</guid><author>prayyojay</author><pubDate>Thu, 20 Oct 2016 10:23:00 +0800</pubDate><description><![CDATA[Given two arrays, write a function to compute their intersection.]]></description><category></category></item><item><title><![CDATA[LeetCode 217. Contains Duplicate 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52869206</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52869206</guid><author>prayyojay</author><pubDate>Thu, 20 Oct 2016 09:50:33 +0800</pubDate><description><![CDATA[Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.]]></description><category></category></item><item><title><![CDATA[LeetCode 392. Is Subsequence 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52860394</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52860394</guid><author>prayyojay</author><pubDate>Wed, 19 Oct 2016 16:06:09 +0800</pubDate><description><![CDATA[Given a string s and a string t, check if s is subsequence of t.
 - You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s]]></description><category></category></item><item><title><![CDATA[LeetCode 169. Majority Element 题解（C++）]]></title><link>https://blog.youkuaiyun.com/prayyojay/article/details/52859248</link><guid>https://blog.youkuaiyun.com/prayyojay/article/details/52859248</guid><author>prayyojay</author><pubDate>Wed, 19 Oct 2016 14:41:46 +0800</pubDate><description><![CDATA[Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.]]></description><category></category></item></channel></rss>