<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lifi的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/github_40155085</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; github_40155085]]></copyright><item><title><![CDATA[#微信小程序开发]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/79935674</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/79935674</guid><author>github_40155085</author><pubDate>Fri, 13 Apr 2018 22:54:54 +0800</pubDate><description><![CDATA[微信小程序开发1. 组件的学习
常用组件 
在微信小程序 组件 中浏览了组件的种类，以及每种组件的具体组件以及所有的属性， 拷贝了给出的样例代码看效果，在开发的时候多回来看应该能熟
数据绑定 
使用双大括号 “{{string}}” 将要wxml绑定的内容与js文件中的data对象  下的数据联系起来
渲染标签 
wx.if 
wx.for
模板导入 
import 
template标签有对应的i]]></description><category></category></item><item><title><![CDATA[系统分析与设计 作业一]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/79528359</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/79528359</guid><author>github_40155085</author><pubDate>Mon, 12 Mar 2018 15:58:28 +0800</pubDate><description><![CDATA[1. 简单题：    Software Engineering is the systematic application of scientific and technological knowledge, methods, and experience to the design, implementation, testing, and documentation of software.]]></description><category></category></item><item><title><![CDATA[Android Studio 中DDMS无法显示文件树以及data文件夹中文件无法导出解决方法]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/79478386</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/79478386</guid><author>github_40155085</author><pubDate>Wed, 07 Mar 2018 23:08:29 +0800</pubDate><description><![CDATA[&amp;lt;div&amp;gt;转载自&amp;lt;a href=&quot;http://blog.youkuaiyun.com/feidie436/article/details/62224354&quot; /&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div id=&quot;article_content&quot; class=&quot;article_content csdn-tracking-statistics tracking-click&quot; data-]]></description><category></category></item><item><title><![CDATA[算法概论8.15]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78943936</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78943936</guid><author>github_40155085</author><pubDate>Sun, 31 Dec 2017 23:48:10 +0800</pubDate><description><![CDATA[最大独立集问题 
要求任意图G=(V,E)G=(V ,E ) 中有大小为 d 的独立集, 
令G1=G(V,E)G_1 =  G(V,E) , 
G2=(V,∅)G_2 = (V ,∅) 
也即是G2G_2各个顶点相互独立。于是G1G_1与G2G_2存在着大小为 d 的公共子图,当且仅当图G 
存在着大小为 d 的独立集。]]></description><category></category></item><item><title><![CDATA[565. Array Nesting]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78943669</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78943669</guid><author>github_40155085</author><pubDate>Sun, 31 Dec 2017 22:41:10 +0800</pubDate><description><![CDATA[1. 原题A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1].Sets S[K] for 0 <= K < N are defined as follows:S[K] = { A[K], A[A[K]],]]></description><category></category></item><item><title><![CDATA[72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78888342</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78888342</guid><author>github_40155085</author><pubDate>Sun, 24 Dec 2017 23:08:25 +0800</pubDate><description><![CDATA[1. 原题Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:]]></description><category></category></item><item><title><![CDATA[495. Teemo Attacking]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78767753</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78767753</guid><author>github_40155085</author><pubDate>Sun, 10 Dec 2017 21:33:18 +0800</pubDate><description><![CDATA[1. 原题In LOL 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]]></description><category></category></item><item><title><![CDATA[102. Binary Tree Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78704499</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78704499</guid><author>github_40155085</author><pubDate>Sun, 03 Dec 2017 21:30:09 +0800</pubDate><description><![CDATA[1. 原题2. 分析
从题目可以看出这是要将节点分层输出
宽度优先搜索要注意的几个点： 在递归式或者迭代式决定分层的，结束条件是什么。
这道题其实要求输出所有的节点，而且没有别的附加条件，只有按层输出，考虑到宽度优先中只有上一层完全搜索过之后，这一层才能搜索，也就是我们的数据结构中，到达新的一层时不能存储有上一层的。所以FCFS的队列合适：在搜索一个节点的时候， 将这个节点弹出并且将他的子节点加入队]]></description><category></category></item><item><title><![CDATA[671. Second Minimum Node In a Binary Tree]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78628265</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78628265</guid><author>github_40155085</author><pubDate>Fri, 24 Nov 2017 20:59:54 +0800</pubDate><description><![CDATA[1. 原题Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node’]]></description><category></category></item><item><title><![CDATA[230. Kth Smallest Element in a BST]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78627747</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78627747</guid><author>github_40155085</author><pubDate>Fri, 24 Nov 2017 19:45:10 +0800</pubDate><description><![CDATA[1. 原题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 element.2. 分析
题目要求找出宽度优先树中的第K小的树。
在没有这]]></description><category></category></item><item><title><![CDATA[152. Maximum Product Subarray]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78575544</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78575544</guid><author>github_40155085</author><pubDate>Sun, 19 Nov 2017 17:33:34 +0800</pubDate><description><![CDATA[1.  原题Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4], 
the contiguous subarray [2,3] has the largest]]></description><category></category></item><item><title><![CDATA[617. Merge Two Binary Trees]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78513069</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78513069</guid><author>github_40155085</author><pubDate>Sun, 12 Nov 2017 17:18:59 +0800</pubDate><description><![CDATA[1. 原题2. 分析
可以看到题中要将两棵树求和， 没有的节点假设为0， 这样可以讲树的求和简化成每个节点的递归， 两棵树的大小也就可以视为一样,直到都检索完
每个节点求和之后，向左右继续递归
3. 代码/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *lef]]></description><category></category></item><item><title><![CDATA[368]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78438796</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78438796</guid><author>github_40155085</author><pubDate>Fri, 03 Nov 2017 19:00:14 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode
原题
分析
代码
1. 原题Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If the]]></description><category></category></item><item><title><![CDATA[718. Maximum Length of Repeated Subarray]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78408902</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78408902</guid><author>github_40155085</author><pubDate>Tue, 31 Oct 2017 22:21:24 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode 
原题
分析
代码
1.原题Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.2. 分析
采用动态规划的方法， 有2个数组， 以dp[i][j]表示以A[ i ] 和 B[ j ]结尾的最长的字符串
如果A[]]></description><category></category></item><item><title><![CDATA[198. House Robber]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78364062</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78364062</guid><author>github_40155085</author><pubDate>Fri, 27 Oct 2017 13:46:48 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode
原题
分析
代码
1. 原题你是一个大盗，要盗取一连串房子的金钱，但是房子的保安系统在你偷2家相邻的房子的时候才会触发。
2. 分析
收线如果nums是空向量，那么返回0.一定要首先排除简单的特殊情况
假设在nums[i]这个位置， 如果选择要偷取这一家的金钱，那么 (i - 1)th 家一定没有被偷，那么在这一家偷取到的金钱总数就是(i-2)th 家的金钱加上]]></description><category></category></item><item><title><![CDATA[53. Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78303840</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78303840</guid><author>github_40155085</author><pubDate>Sat, 21 Oct 2017 15:22:47 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode
原题
分析： 
题目要求在一个连续数组中找到一个子数组，是的子数组的元素的和最大。可以使用暴力解答， n 个数一共有 C2nC_{n}^{2} 种选择，分别计算这 C2nC_{n}^{2} 种选择的结果然后求最大值，但是时间复杂度 O(n2)O(n^2),这道题不通过。。
可以使用分治算法：
  > 
  假设数组A的low, mid, high分别表示数组相应]]></description><category></category></item><item><title><![CDATA[5. Longest Palindromic Substring（最长回文子串）]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78045564</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78045564</guid><author>github_40155085</author><pubDate>Wed, 20 Sep 2017 21:11:19 +0800</pubDate><description><![CDATA[原题
分析
代码1. 原题Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.2. 分析：
求一个字符串中的最长回文，最容易想到的一种就是：使用循环，在 str[ i ] 这个字符的时候， 不断同时向前和向后一样长的单位直到]]></description><category></category></item><item><title><![CDATA[# 324. Wiggle Sort II]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/78010274</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/78010274</guid><author>github_40155085</author><pubDate>Sun, 17 Sep 2017 14:54:29 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode
原题
分析
需要注意的一些细节
代码
1. 原题Given an unsorted array nums, reorder it such that nums[0] < nums1 > nums[2] < nums[3]….Example: 
(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is]]></description><category></category></item><item><title><![CDATA[667. Beautiful Arrangement II]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/77938522</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/77938522</guid><author>github_40155085</author><pubDate>Mon, 11 Sep 2017 22:00:50 +0800</pubDate><description><![CDATA[标签（空格分隔）： leetcode
原题
分析
代码实现过程中的一些坑
代码
1.原题Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requirement]]></description><category></category></item><item><title><![CDATA[561. Array Partition I]]></title><link>https://blog.youkuaiyun.com/github_40155085/article/details/77933243</link><guid>https://blog.youkuaiyun.com/github_40155085/article/details/77933243</guid><author>github_40155085</author><pubDate>Mon, 11 Sep 2017 14:59:50 +0800</pubDate><description><![CDATA[561. Array Partition I标签（空格分隔）： leetcodeArray Partition I
原题
分析
代码
1. 原题Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn)]]></description><category></category></item></channel></rss>