<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ApRiLLLLLLLLLLLL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ApRiLLLLLLLLLLLL]]></copyright><item><title><![CDATA[[Leetcode] 485. Max Consecutive Ones]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81285617</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81285617</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Mon, 30 Jul 2018 15:17:02 +0800</pubDate><description><![CDATA[Description:

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:


Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 226. Invert Binary Tree]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81284639</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81284639</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Mon, 30 Jul 2018 14:35:46 +0800</pubDate><description><![CDATA[Description:

Invert a binary tree.

Example:

Input:


     4
   /   \
  2     7
 / \   / \
1   3 6   9

Output:


     4
   /   \
  7     2
 / \   / \
9   6 3   1

Trivia:
This problem was inspired ...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 824. Goat Latin]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81238552</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81238552</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Fri, 27 Jul 2018 15:42:27 +0800</pubDate><description><![CDATA[Description:

A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.

We would like to convert the sentence to &quot;Goat Latin&quot; (a made-u...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 292. Nim Game]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81236231</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81236231</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Fri, 27 Jul 2018 14:07:26 +0800</pubDate><description><![CDATA[Description:

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last sto...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 762. Prime Number of Set Bits in Binary Representation]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81235783</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81235783</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Fri, 27 Jul 2018 13:40:16 +0800</pubDate><description><![CDATA[Description:

Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.

(Recall that the number of set bi...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 521. Longest Uncommon Subsequence I]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81222082</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81222082</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Thu, 26 Jul 2018 16:09:20 +0800</pubDate><description><![CDATA[Description:

Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of on...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 104. Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81219763</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81219763</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Thu, 26 Jul 2018 14:40:35 +0800</pubDate><description><![CDATA[Description:

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node w...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 693. Binary Number with Alternating Bits]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81218844</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81218844</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Thu, 26 Jul 2018 13:58:41 +0800</pubDate><description><![CDATA[Description:

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Example 1:


Input: 5
Output: True
Explanation:
The bina...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 637. Average of Levels in Binary Tree]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81205412</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81205412</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Wed, 25 Jul 2018 16:32:51 +0800</pubDate><description><![CDATA[Description:

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:


Input:
    3
   / \
  9  20
    /  \
   15   7
Output: [3, 14.5,...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 136. Single Number]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81202977</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81202977</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Wed, 25 Jul 2018 14:59:00 +0800</pubDate><description><![CDATA[Description

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement ...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 496. Next Greater Element I]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80883014</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80883014</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Mon, 02 Jul 2018 13:23:38 +0800</pubDate><description><![CDATA[Description:You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 412. Fizz Buzz]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80852559</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80852559</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Fri, 29 Jun 2018 09:58:02 +0800</pubDate><description><![CDATA[Description:Write a program that outputs the string representation of numbers from 1 to n.But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output ...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 575. Distribute Candies]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80840838</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80840838</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Thu, 28 Jun 2018 11:37:48 +0800</pubDate><description><![CDATA[Description:Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to dist...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 463. Island Perimeter]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80825408</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80825408</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Wed, 27 Jun 2018 10:31:37 +0800</pubDate><description><![CDATA[Description:You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 811.Subdomain Visit Count]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80799274</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80799274</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Mon, 25 Jun 2018 14:22:20 +0800</pubDate><description><![CDATA[Description:A website domain like &quot;discuss.leetcode.com&quot; consists of various subdomains. At the top level, we have &quot;com&quot;, at the next level, we have &quot;leetcode.com&quot;, and at the lowest level, &quot;discuss.l...]]></description><category></category></item><item><title><![CDATA[[Leetcode] 476. Number Complement]]></title><link>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80799552</link><guid>https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/80799552</guid><author>ApRiLLLLLLLLLLLL</author><pubDate>Mon, 25 Jun 2018 14:21:36 +0800</pubDate><description><![CDATA[Description:Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer is guaranteed to fit within the rang...]]></description><category></category></item></channel></rss>