<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bxtx520的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bxtx520</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bxtx520]]></copyright><item><title><![CDATA[二叉树的最大路径和]]></title><link>https://blog.youkuaiyun.com/bxtx520/article/details/106202696</link><guid>https://blog.youkuaiyun.com/bxtx520/article/details/106202696</guid><author>bxtx520</author><pubDate>Mon, 18 May 2020 22:34:01 +0800</pubDate><description><![CDATA[问题：

给定一个非空二叉树，返回其最大路径和。

本题中，路径被定义为一条从树中任意节点出发，达到任意节点的序列。该路径至少包含一个节点，且不一定经过根节点。




public class erChaShuMax {
	int max_sum = Integer.MIN_VALUE;
	public int max_gain(TreeNode root) {
		//如果递归到叶子节点的边界
		if(root == null) {
			return 0;
		}
		//如果到了边界返回一定是0，]]></description><category></category></item><item><title><![CDATA[二叉树的层次遍历使用广度优先]]></title><link>https://blog.youkuaiyun.com/bxtx520/article/details/106063678</link><guid>https://blog.youkuaiyun.com/bxtx520/article/details/106063678</guid><author>bxtx520</author><pubDate>Mon, 11 May 2020 21:58:43 +0800</pubDate><description><![CDATA[方法二：

使用队列的广度优先


class guangdu{
	public List&lt;List&lt;Integer&gt;&gt; levelOrder(TreeNode root){
		List&lt;List&lt;Integer&gt;&gt; list = new ArrayList&lt;&gt;();
		if(root == null) return list;
		//队列的性质：先进先出，从头取，从尾添加
		Queue&lt;TreeNode&gt; queue = ne]]></description><category></category></item><item><title><![CDATA[用Java实现二叉树的层次遍历使用递归和广度优先]]></title><link>https://blog.youkuaiyun.com/bxtx520/article/details/106062813</link><guid>https://blog.youkuaiyun.com/bxtx520/article/details/106062813</guid><author>bxtx520</author><pubDate>Mon, 11 May 2020 21:34:11 +0800</pubDate><description><![CDATA[·如何实现一个二叉树的层次遍历：
方法一使用递归（借助辅助参数level)


public class cengCiErChaShu {
	//使用递归
	List&lt;List&lt;Integer&gt;&gt; list = new ArrayList&lt;&gt;();
	public List&lt;List&lt;Integer&gt;&gt; levelOrder(TreeNode root){
		if(root == null) {
			return list;
		}
		hel]]></description><category></category></item><item><title><![CDATA[识别排序数组中两个交换元素的经典问题]]></title><link>https://blog.youkuaiyun.com/bxtx520/article/details/106047069</link><guid>https://blog.youkuaiyun.com/bxtx520/article/details/106047069</guid><author>bxtx520</author><pubDate>Mon, 11 May 2020 09:32:51 +0800</pubDate><description><![CDATA[public static void findTwoSwapped(List&lt;Integer&gt; nums) {
	    int n = nums.size();
	    for(int i = 0; i &lt; n - 1; i++) {
	      if (nums.get(i + 1) &lt; nums.get(i)) {
            //判断巧妙
	        y = nums.get(i + 1);
	       
	        if (x == -1).]]></description><category></category></item><item><title><![CDATA[开始奋斗算法了]]></title><link>https://blog.youkuaiyun.com/bxtx520/article/details/105991645</link><guid>https://blog.youkuaiyun.com/bxtx520/article/details/105991645</guid><author>bxtx520</author><pubDate>Fri, 08 May 2020 11:25:43 +0800</pubDate><description><![CDATA[一个即将面临秋招的渣哇程序猿，在近期的笔试面试中，看到不会算法的java程序猿，不是一个完美的程序猿。所以本猿，从今天开始准备开始攻算法了，各位志同道和的猿友，大家一起加油。
...]]></description><category></category></item></channel></rss>