<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pablojie的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pablojie</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pablojie]]></copyright><item><title><![CDATA[[LeetCode]150.Evaluate Reverse Polish Notation]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52979244</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52979244</guid><author>pablojie</author><pubDate>Mon, 31 Oct 2016 04:49:17 +0800</pubDate><description><![CDATA[Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /.
 Each operand may be an integer or another expression.

Some examples:

  ["2", "1", ]]></description><category></category></item><item><title><![CDATA[[LeetCode]422. Valid Word Square]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52868798</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52868798</guid><author>pablojie</author><pubDate>Thu, 20 Oct 2016 08:58:30 +0800</pubDate><description><![CDATA[Given a sequence of words, check whether it forms a valid word square.

A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 ≤ k <
 max(numRow]]></description><category></category></item><item><title><![CDATA[[LeetCode]2. Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52857615</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52857615</guid><author>pablojie</author><pubDate>Wed, 19 Oct 2016 11:04:45 +0800</pubDate><description><![CDATA[You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link]]></description><category></category></item><item><title><![CDATA[[LeetCode]94. Binary Tree Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52834556</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52834556</guid><author>pablojie</author><pubDate>Mon, 17 Oct 2016 00:38:13 +0800</pubDate><description><![CDATA[Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3




return [1,3,2].

Note: Recursive solu]]></description><category></category></item><item><title><![CDATA[[Hackrank]Get Node Value]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52829009</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52829009</guid><author>pablojie</author><pubDate>Sun, 16 Oct 2016 09:31:12 +0800</pubDate><description><![CDATA[You’re given the pointer to the head node of a linked list and a specific position. Counting backwards from the tail node of the linked list, get the value of the node at the given position. A positio]]></description><category></category></item><item><title><![CDATA[[LeetCode]170. Two Sum III - Data structure design]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52754959</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52754959</guid><author>pablojie</author><pubDate>Sat, 08 Oct 2016 11:10:43 +0800</pubDate><description><![CDATA[Design and implement a TwoSum class. It should support the following operations: add and find.

add - Add the number to an internal data structure.
find - Find if there exists any pair of numbers w]]></description><category></category></item><item><title><![CDATA[[LeetCode]230. Kth Smallest Element in a BST]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52753231</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52753231</guid><author>pablojie</author><pubDate>Sat, 08 Oct 2016 03:52:09 +0800</pubDate><description><![CDATA[Given a binary search tree, write a function kthSmallest to find the kth
 smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

Follow up:

What if t]]></description><category></category></item><item><title><![CDATA[[LeetCode]1. Two Sum]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52747196</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52747196</guid><author>pablojie</author><pubDate>Fri, 07 Oct 2016 03:39:25 +0800</pubDate><description><![CDATA[Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums =]]></description><category></category></item><item><title><![CDATA[[LeetCode]100. Same Tree]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52747166</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52747166</guid><author>pablojie</author><pubDate>Fri, 07 Oct 2016 03:08:25 +0800</pubDate><description><![CDATA[Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

思路：

这是一]]></description><category></category></item><item><title><![CDATA[[LeetCode]268. Missing Number]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52741532</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52741532</guid><author>pablojie</author><pubDate>Thu, 06 Oct 2016 00:20:37 +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.

For example,
Given nums = [0, 1, 3] return 2.

Note:

Your algorithm sho]]></description><category></category></item><item><title><![CDATA[[LeetCode]225. Implement Stack using Queues]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52736862</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52736862</guid><author>pablojie</author><pubDate>Wed, 05 Oct 2016 03:52:38 +0800</pubDate><description><![CDATA[Implement the following operations of a stack using queues.

push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet]]></description><category></category></item><item><title><![CDATA[Android学习笔记1.1]]></title><link>https://blog.youkuaiyun.com/pablojie/article/details/52736225</link><guid>https://blog.youkuaiyun.com/pablojie/article/details/52736225</guid><author>pablojie</author><pubDate>Tue, 04 Oct 2016 23:44:06 +0800</pubDate><description><![CDATA[Udacity android第一周学习笔记]]></description><category></category></item></channel></rss>