<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sscssz的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sscssz</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sscssz]]></copyright><item><title><![CDATA[【LeetCode】126. Word Ladder II【H】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/68952009</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/68952009</guid><author>sscssz</author><pubDate>Sun, 02 Apr 2017 14:23:26 +0800</pubDate><description><![CDATA[Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:

Only one letter can be changed at a timeEac]]></description><category></category></item><item><title><![CDATA[【LeetCode】537. Complex Number Multiplication【M】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/68924067</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/68924067</guid><author>sscssz</author><pubDate>Fri, 31 Mar 2017 13:24:52 +0800</pubDate><description><![CDATA[Given two strings representing two complex numbers.

You need to return a string representing their multiplication. Note i2 = -1 according to the definition.

Example 1:

Input: "1+1i", "1+1i"
O]]></description><category></category></item><item><title><![CDATA[【LeetCode】526. Beautiful Arrangement【M】【35】【回溯】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/68924050</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/68924050</guid><author>sscssz</author><pubDate>Fri, 31 Mar 2017 13:23:39 +0800</pubDate><description><![CDATA[Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position
 (1 ≤ i]]></description><category></category></item><item><title><![CDATA[103. Binary Tree Zigzag Level Order Traversal【M】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/68060250</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/68060250</guid><author>sscssz</author><pubDate>Wed, 29 Mar 2017 10:09:58 +0800</pubDate><description><![CDATA[Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary ]]></description><category></category></item><item><title><![CDATA[【LeetCode】504. Base 7【E】【94】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/58020417</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/58020417</guid><author>sscssz</author><pubDate>Mon, 27 Feb 2017 11:06:09 +0800</pubDate><description><![CDATA[Given an integer, return its base 7 string representation.

Example 1:

Input: 100
Output: "202"




Example 2:

Input: -7
Output: "-10"




Note: The input will be in range of [-1e7, 1e]]></description><category></category></item><item><title><![CDATA[【LeetCode】506. Relative Ranks【E】【50】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56899905</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56899905</guid><author>sscssz</author><pubDate>Fri, 24 Feb 2017 21:47:34 +0800</pubDate><description><![CDATA[Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".

Example 1:

In]]></description><category></category></item><item><title><![CDATA[【LeetCode】492. Construct the Rectangle【E】【73】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56675011</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56675011</guid><author>sscssz</author><pubDate>Thu, 23 Feb 2017 16:23:15 +0800</pubDate><description><![CDATA[For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L]]></description><category></category></item><item><title><![CDATA[【LeetCode】520. Detect Capital【E】【83】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56494748</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56494748</guid><author>sscssz</author><pubDate>Wed, 22 Feb 2017 19:03:54 +0800</pubDate><description><![CDATA[Given a word, you need to judge whether the usage of capitals in it is right or not.

We define the usage of capitals in a word to be right when one of the following cases holds:

All letters in t]]></description><category></category></item><item><title><![CDATA[【LeetCode】508. Most Frequent Subtree Sum【M】【40】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56484002</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56484002</guid><author>sscssz</author><pubDate>Wed, 22 Feb 2017 13:34:02 +0800</pubDate><description><![CDATA[Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (includi]]></description><category></category></item><item><title><![CDATA[【LeetCode】442. Find All Duplicates in an Array【M】【60】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56481102</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56481102</guid><author>sscssz</author><pubDate>Wed, 22 Feb 2017 11:02:35 +0800</pubDate><description><![CDATA[Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements that appear twice in this array.

Could you do it without ex]]></description><category></category></item><item><title><![CDATA[【LeetCode】495. Teemo Attacking【M】【41】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/56292201</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/56292201</guid><author>sscssz</author><pubDate>Tue, 21 Feb 2017 18:45:39 +0800</pubDate><description><![CDATA[In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning tim]]></description><category></category></item><item><title><![CDATA[【LeetCode】515. Find Largest Value in Each Tree Row【E】【87】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55806425</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55806425</guid><author>sscssz</author><pubDate>Sun, 19 Feb 2017 18:37:01 +0800</pubDate><description><![CDATA[You need to find the largest value in each row of a binary tree.

Example:

Input: 

          1
         / \
        3   2
       / \   \  
      5   3   9 

Output: [1, 3, 9]







Subsc]]></description><category></category></item><item><title><![CDATA[【LeetCode】451. Sort Characters By Frequency【M】【68】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55802749</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55802749</guid><author>sscssz</author><pubDate>Sun, 19 Feb 2017 10:30:50 +0800</pubDate><description><![CDATA[Given a string, sort it in decreasing order based on the frequency of characters.

Example 1:
Input:
"tree"

Output:
"eert"

Explanation:
'e' appears twice while 'r' and 't' both appear once.
So 'e]]></description><category></category></item><item><title><![CDATA[【LeetCode】448. Find All Numbers Disappeared in an Array【E】【77】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55668233</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55668233</guid><author>sscssz</author><pubDate>Sat, 18 Feb 2017 16:20:19 +0800</pubDate><description><![CDATA[Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

]]></description><category></category></item><item><title><![CDATA[【LeetCode】513. Find Bottom Left Tree Value【M】【73】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55662188</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55662188</guid><author>sscssz</author><pubDate>Sat, 18 Feb 2017 13:19:05 +0800</pubDate><description><![CDATA[Given a binary tree, find the leftmost value in the last row of the tree.

Example 1:

Input:

    2
   / \
  1   3

Output:
1




Example 2: 

Input:

        1
       / \
      2   3]]></description><category></category></item><item><title><![CDATA[【LeetCode】496. Next Greater Element I【E】【94】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55656008</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55656008</guid><author>sscssz</author><pubDate>Sat, 18 Feb 2017 10:01:39 +0800</pubDate><description><![CDATA[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 of nums]]></description><category></category></item><item><title><![CDATA[【LeetCode】500. Keyboard Row【E】【75】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55506995</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55506995</guid><author>sscssz</author><pubDate>Fri, 17 Feb 2017 13:09:32 +0800</pubDate><description><![CDATA[Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.





Example 1:

Input: ["Hello", "Alaska", "Da]]></description><category></category></item><item><title><![CDATA[【LeetCode】476. Number Complement【E】【59】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55506201</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55506201</guid><author>sscssz</author><pubDate>Fri, 17 Feb 2017 11:31:16 +0800</pubDate><description><![CDATA[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 range]]></description><category></category></item><item><title><![CDATA[【LeetCode】461. Hamming Distance【E】【90】]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/55254450</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/55254450</guid><author>sscssz</author><pubDate>Thu, 16 Feb 2017 12:32:05 +0800</pubDate><description><![CDATA[The Hamming distance between two integers is the number of positions at which the corresponding
 bits are different.

Given two integers x and y,
 calculate the Hamming distance.

Note:
0 ≤ x,]]></description><category></category></item><item><title><![CDATA[学习tensorflow之mac上安装tensorflow]]></title><link>https://blog.youkuaiyun.com/sscssz/article/details/53742066</link><guid>https://blog.youkuaiyun.com/sscssz/article/details/53742066</guid><author>sscssz</author><pubDate>Mon, 19 Dec 2016 16:10:49 +0800</pubDate><description><![CDATA[背景

听说谷歌的第二代机器学习的框架 tensorflow 开源了,我也心血来潮去探探大牛的产品.怎奈安装就折腾了一天,现在整理出来备忘. 

tensorflow官方网站给出的安装步骤很简单:
# Only CPU-version is available at the moment.
$ pip install https://storage.googleapis.com/tens]]></description><category></category></item></channel></rss>