<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Coder进阶之路]]></title><description><![CDATA[谁终将声震人间，必长久深自缄默；谁终将点燃闪电，必长久如云漂泊。]]></description><link>https://blog.youkuaiyun.com/Ssunsets</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ssunsets]]></copyright><item><title><![CDATA[深入理解Java注解——注解处理器]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/51042501</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/51042501</guid><author>Ssunsets</author><pubDate>Sat, 02 Apr 2016 08:03:08 +0800</pubDate><description><![CDATA[如果没有用来读取注解的方法和工作，那么注解也就不会比注释更有用处了。使用注解的过程中，很重要的一部分就是创建于使用注解处理器。Java SE5扩展了反射机制的API，以帮助程序员快速的构造自定义注解处理器。注解处理器类库(java.lang.reflect.AnnotatedElement)：　　Java使用Annotation接口来代表程序元素前面的注解，该接口是所有Annotation类型的父接]]></description><category></category></item><item><title><![CDATA[深入理解Java注解——元注解及自定义注解]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/51042496</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/51042496</guid><author>Ssunsets</author><pubDate>Sat, 02 Apr 2016 07:55:47 +0800</pubDate><description><![CDATA[要深入学习注解，我们就必须能定义自己的注解，并使用注解，在定义自己的注解之前，我们就必须要了解Java为我们提供的元注解和相关定义注解的语法。元注解：　　元注解的作用就是负责注解其他注解。Java5.0定义了4个标准的meta-annotation类型，它们被用来提供对其它 annotation类型作说明。Java5.0定义的元注解： 
　　　　1.@Target, 
　　　　2.@Retentio]]></description><category></category></item><item><title><![CDATA[深入理解Java注解——注解之基本概念]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/51042494</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/51042494</guid><author>Ssunsets</author><pubDate>Sat, 02 Apr 2016 07:47:00 +0800</pubDate><description><![CDATA[什么是注解（Annotation）：　　Annotation（注解）就是Java提供了一种元程序中的元素关联任何信息和着任何元数据（metadata）的途径和方法。Annotion(注解)是一个接口，程序可以通过反射来获取指定程序元素的Annotion对象，然后通过Annotion对象来获取注解里面的元数据。　　Annotation(注解)是JDK5.0及以后版本引入的。它可以用于创建文档，跟踪代码]]></description><category></category></item><item><title><![CDATA[Java反射机制的总结]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/51024619</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/51024619</guid><author>Ssunsets</author><pubDate>Thu, 31 Mar 2016 11:18:20 +0800</pubDate><description><![CDATA[能够分析类能力的程序成为反射，反射机制基本用途如下:
在运行时分析类的能力。
在运行中查看对象。
实现通用的数组操作代码。
利用Method对象。
反射是一种功能强大且复杂的机制，使用它主要用来构造工具而不是进行应用程序的开发。得到Class对象的三种方法： 1.利用对象: Class c = new Object().getClass();
 2.利用Class的静态方法: Class c = C]]></description><category></category></item><item><title><![CDATA[LeetCode(33) Search in Rotated Sorted Array解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50541823</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50541823</guid><author>Ssunsets</author><pubDate>Tue, 19 Jan 2016 13:17:26 +0800</pubDate><description><![CDATA[Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its index]]></description><category></category></item><item><title><![CDATA[LeetCode(80) Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50541190</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50541190</guid><author>Ssunsets</author><pubDate>Tue, 19 Jan 2016 11:08:23 +0800</pubDate><description><![CDATA[Follow up for “Remove Duplicates”: 
What if duplicates are allowed at most twice?For example, 
Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five elemen]]></description><category></category></item><item><title><![CDATA[LeetCode(26) Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50540248</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50540248</guid><author>Ssunsets</author><pubDate>Tue, 19 Jan 2016 08:47:22 +0800</pubDate><description><![CDATA[Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with cons]]></description><category></category></item><item><title><![CDATA[LeetCode(236) Lowest Common Ancestor of a Binary Tree解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50338721</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50338721</guid><author>Ssunsets</author><pubDate>Thu, 17 Dec 2015 10:56:05 +0800</pubDate><description><![CDATA[Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and]]></description><category></category></item><item><title><![CDATA[LeetCode(254) Binary Tree Paths解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50325055</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50325055</guid><author>Ssunsets</author><pubDate>Wed, 16 Dec 2015 11:01:12 +0800</pubDate><description><![CDATA[Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree:   1
 /   \
2     3
 \
  5All root-to-leaf paths are:["1->2->5", "1->3"]解题思路: 
代码应该看得懂，先序遍历，处理字符串。public]]></description><category></category></item><item><title><![CDATA[LeetCode(235) Lowest Common Ancestor of a Binary Search Tree解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50324343</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50324343</guid><author>Ssunsets</author><pubDate>Wed, 16 Dec 2015 10:24:34 +0800</pubDate><description><![CDATA[Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two]]></description><category></category></item><item><title><![CDATA[LeetCode(222) Count Complete Tree Nodes解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50323461</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50323461</guid><author>Ssunsets</author><pubDate>Wed, 16 Dec 2015 09:21:17 +0800</pubDate><description><![CDATA[Given a complete binary tree, count the number of nodes.解题思路: 
直接暴力求解超时，注意到一个完全二叉树，它的任何子树，要么是一个满二叉树，要么是一个完全二叉树。通过求一个二叉树最左的深度，最右的深度，来判断是不是满二叉树，如果不是满二叉树，则递归求解，如果是则套用公式(2 << 深度) - 1。public class Solution]]></description><category></category></item><item><title><![CDATA[LeetCode(199) Binary Tree Right Side View解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50323149</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50323149</guid><author>Ssunsets</author><pubDate>Wed, 16 Dec 2015 08:13:45 +0800</pubDate><description><![CDATA[Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: 
Given the following binary tree,   1]]></description><category></category></item><item><title><![CDATA[LeetCode(173) Binary Search Tree Iterator解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50321761</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50321761</guid><author>Ssunsets</author><pubDate>Tue, 15 Dec 2015 22:43:38 +0800</pubDate><description><![CDATA[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 smallest number in the BST.Note: next() and hasN]]></description><category></category></item><item><title><![CDATA[LeetCode(145) Binary Tree Postorder Traversal解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50319385</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50319385</guid><author>Ssunsets</author><pubDate>Tue, 15 Dec 2015 19:02:50 +0800</pubDate><description><![CDATA[Given a binary tree, return the postorder traversal of its nodes’ values.For example: 
Given binary tree {1,#,2,3},   1
    \
     2
    /
   3return [3,2,1].解题报告:递归解法是普通的后续遍历，不用多说，非递归用了一个栈来存储结点，想了好久也没]]></description><category></category></item><item><title><![CDATA[LeetCode(144) Binary Tree Preorder Traversal解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50318003</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50318003</guid><author>Ssunsets</author><pubDate>Tue, 15 Dec 2015 17:09:51 +0800</pubDate><description><![CDATA[Given a binary tree, return the preorder traversal of its nodes’ values.For example: 
Given binary tree {1,#,2,3},   1
    \
     2
    /
   3解题思路:递归解法是很普通的先序遍历，非递归的解法灵感来源于我的解题报告LeetCode(114)，看不懂的话可以去看]]></description><category></category></item><item><title><![CDATA[Tomcat(免安装版)环境变量及基本配置]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50299377</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50299377</guid><author>Ssunsets</author><pubDate>Mon, 14 Dec 2015 19:19:20 +0800</pubDate><description><![CDATA[Tomcat是什么就不用多说了，简单说一下java环境变量的配置问题，注意选择适合自己电脑版本的jdk，如果是32位系统千万别下载64位的jdk，而且tomcat也要选择合适版本的jdk，之前tomcat状态一直是stoped，很伤脑筋，试了各种解决办法，最后发现笔记本jdk是64位的，而tomcat为了能给云主机(32位)使用，下了32位的，所以服务打不开。
一:JDK下载及配置jdk下载链接:h]]></description><category></category></item><item><title><![CDATA[LeetCode(124) Binary Tree Maximum Path Sum解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50292895</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50292895</guid><author>Ssunsets</author><pubDate>Mon, 14 Dec 2015 11:50:46 +0800</pubDate><description><![CDATA[Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path]]></description><category></category></item><item><title><![CDATA[LeetCode(114) Flatten Binary Tree to Linked List解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50290943</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50290943</guid><author>Ssunsets</author><pubDate>Mon, 14 Dec 2015 09:57:42 +0800</pubDate><description><![CDATA[Given a binary tree, flatten it to a linked list in-place.For example, 
Given         1
        / \
       2   5
      / \   \
     3   4   6The flattened tree should look like:   1
    \
     2]]></description><category></category></item><item><title><![CDATA[LeetCode(111) Minimum Depth of Binary Tree解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50282399</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50282399</guid><author>Ssunsets</author><pubDate>Sun, 13 Dec 2015 13:30:06 +0800</pubDate><description><![CDATA[Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.解题思路:递归求解，如果有比min还小的深度，就更新min，需要注意的是，最小深度是叶]]></description><category></category></item><item><title><![CDATA[LeetCode(110) Balanced Binary Tree解题报告]]></title><link>https://blog.youkuaiyun.com/Ssunsets/article/details/50282233</link><guid>https://blog.youkuaiyun.com/Ssunsets/article/details/50282233</guid><author>Ssunsets</author><pubDate>Sun, 13 Dec 2015 12:56:31 +0800</pubDate><description><![CDATA[Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by]]></description><category></category></item></channel></rss>