<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Frank Chan的窝]]></title><description><![CDATA[一万个小时的路上]]></description><link>https://blog.youkuaiyun.com/androidchanhao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; androidchanhao]]></copyright><item><title><![CDATA[《统计学习方法》第二章-感知机-总结]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/82291767</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/82291767</guid><author>androidchanhao</author><pubDate>Sat, 01 Sep 2018 23:01:43 +0800</pubDate><description><![CDATA[《统计学习方法》第二章-感知机学习算法-总结。]]></description><category></category></item><item><title><![CDATA[leetcode 125. Valid Palindrome 题解]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/82215403</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/82215403</guid><author>androidchanhao</author><pubDate>Thu, 30 Aug 2018 08:25:26 +0800</pubDate><description><![CDATA[leetcode 125. Valid Palindrome 题解。]]></description><category></category></item><item><title><![CDATA[leetcode 833. Find And Replace in String 题解]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/82047678</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/82047678</guid><author>androidchanhao</author><pubDate>Sat, 25 Aug 2018 07:43:23 +0800</pubDate><description><![CDATA[leetcode 833. Find And Replace in String 题解]]></description><category></category></item><item><title><![CDATA[leetcode 686. Repeated String Match 题解]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81937308</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81937308</guid><author>androidchanhao</author><pubDate>Wed, 22 Aug 2018 07:10:43 +0800</pubDate><description><![CDATA[leetcode 686. Repeated String Match 题解。]]></description><category></category></item><item><title><![CDATA[leetcode 888. Fair Candy Swap 题解【Weekly Content 98 I】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81837394</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81837394</guid><author>androidchanhao</author><pubDate>Sun, 19 Aug 2018 13:39:24 +0800</pubDate><description><![CDATA[leetcode Weekly Content 98 第1题 888. Fair Candy Swap 的题解。]]></description><category></category></item><item><title><![CDATA[leetcode 49. Group Anagrams 题解]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81784172</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81784172</guid><author>androidchanhao</author><pubDate>Fri, 17 Aug 2018 22:55:02 +0800</pubDate><description><![CDATA[leetcode 49. Group Anagrams 题解。]]></description><category></category></item><item><title><![CDATA[leetcode 58. Length of Last Word 题解【C++/Java/Python/JS】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81739813</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81739813</guid><author>androidchanhao</author><pubDate>Thu, 16 Aug 2018 13:27:24 +0800</pubDate><description><![CDATA[58. 最后一个单词的长度 
58. Length of Last Word

题目：

给定一个仅包含大小写字母和空格' ' 的字符串，返回其最后一个单词的长度。

如果不存在最后一个单词，请返回0 。

说明：一个单词是指由字母组成，但不包含任何空格的字符串。



示例:


  输入: “Hello World” 
  输出: 5




题解:

主要思路是从右向左遍历。先找到第一个非空...]]></description><category></category></item><item><title><![CDATA[leetcode 680. Valid Palindrome II 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81659951</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81659951</guid><author>androidchanhao</author><pubDate>Tue, 14 Aug 2018 07:37:12 +0800</pubDate><description><![CDATA[leetcode 680 Valid Palindrome II 题解。]]></description><category></category></item><item><title><![CDATA[leetcode 831. Masking Personal Information 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81535602</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81535602</guid><author>androidchanhao</author><pubDate>Thu, 09 Aug 2018 14:06:03 +0800</pubDate><description><![CDATA[leetcode 831题解【C++/Java/Python】]]></description><category></category></item><item><title><![CDATA[leetcode 20. Valid Parentheses 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81475454</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81475454</guid><author>androidchanhao</author><pubDate>Tue, 07 Aug 2018 09:40:11 +0800</pubDate><description><![CDATA[leetcode 20的题解]]></description><category></category></item><item><title><![CDATA[3行命令搞定应用流量查询]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/51739343</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/51739343</guid><author>androidchanhao</author><pubDate>Sat, 04 Aug 2018 11:16:50 +0800</pubDate><description><![CDATA[一、查看原理：某个应用的网络流量数据保存在系的/proc/uid_stat/$UID/tcp_rcv文件中。

二、步骤：

（1）查看当前应用的pid：通过ps命令查看当前应用的进程id，比如应用中心的获取方式为ps|grep appstore，获取的值为10928

（2）查看当前应用的uid：进入目录/proc/$PID，查看status文件的UID值，比如应用中心的查看方式，cd /pro]]></description><category></category></item><item><title><![CDATA[leetcode 443. String Compression 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81408345</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81408345</guid><author>androidchanhao</author><pubDate>Sat, 04 Aug 2018 10:52:24 +0800</pubDate><description><![CDATA[leetcode题目 443. String Compression 的题解]]></description><category></category></item><item><title><![CDATA[leetcode 539. Minimum Time Difference 题解【C++ & Java & Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81297006</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81297006</guid><author>androidchanhao</author><pubDate>Tue, 31 Jul 2018 10:05:00 +0800</pubDate><description><![CDATA[leetcode题目539. Minimum Time Difference (539. 最小时间差)的题解。]]></description><category></category></item><item><title><![CDATA[leetcode 877. Stone Game 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81271077</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81271077</guid><author>androidchanhao</author><pubDate>Sun, 29 Jul 2018 14:58:13 +0800</pubDate><description><![CDATA[题目链接： 
https://leetcode.com/problems/stone-game/discuss/ 
https://leetcode-cn.com/contest/weekly-contest-95/problems/stone-game/



877. 石子游戏

亚历克斯和李用几堆石子在做游戏。偶数堆石子排成一行，每堆都有正整数颗石子 piles[i] 。

游戏以谁手中的石...]]></description><category></category></item><item><title><![CDATA[leetcode 874. Walking Robot Simulation 题解【C++/Java/Python】]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81269418</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81269418</guid><author>androidchanhao</author><pubDate>Sun, 29 Jul 2018 11:31:16 +0800</pubDate><description><![CDATA[leetcode题目874 Walking Robot Simulation的题解]]></description><category></category></item><item><title><![CDATA[北大2018暑期ACM培训练习题02:河中跳房子]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/81265996</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/81265996</guid><author>androidchanhao</author><pubDate>Sat, 28 Jul 2018 22:05:18 +0800</pubDate><description><![CDATA[题目链接：02:河中跳房子

总时间限制: 1000ms 内存限制: 65536kB



描述

每年奶牛们都要举办各种特殊版本的跳房子比赛，包括在河里从一个岩石跳到另一个岩石。这项激动人心的活动在一条长长的笔直河道中进行，在起点和离起点L远 (1 ≤ L≤ 1,000,000,000) 的终点处均有一个岩石。在起点和终点之间，有N (0 ≤ N ≤ 50,000) 个岩石，每个岩石与起点的距离...]]></description><category></category></item><item><title><![CDATA[动态规划投资问题]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/79602465</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/79602465</guid><author>androidchanhao</author><pubDate>Sun, 18 Mar 2018 17:31:40 +0800</pubDate><description><![CDATA[//
//  opt_investment.c
//  
//
//  Created by focus on 2018/3/18.
//

#include &quot;opt_investment.h&quot;
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;limits.h&amp;gt;
#define ROWS 4//投资的项目数量
#define COLS 5//投资的钱数（单位：万元）...]]></description><category></category></item><item><title><![CDATA[TensorFlow中Session的使用]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/79595004</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/79595004</guid><author>androidchanhao</author><pubDate>Sat, 17 Mar 2018 19:47:01 +0800</pubDate><description><![CDATA[TensorFlow中Session的使用

TensorFlow中只有让Graph（计算图）上的节点在Session（会话）中执行，才会得到结果。Session的开启涉及真实的运算，因此比较消耗资源。在使用结束后，务必关闭Session。

import tensorflow as tf
a = tf.constant(1, dtype=tf.int8)
b = tf.constant(2, d...]]></description><category></category></item><item><title><![CDATA[最快的TensorFlow入门32行代码]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/79573199</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/79573199</guid><author>androidchanhao</author><pubDate>Thu, 15 Mar 2018 20:17:39 +0800</pubDate><description><![CDATA[TensorFlow是基于python的，因此得首先具备python基础。最好的学习方式，莫过于举

例。TensorFlow官网更新非常快，曾经领自己入门的例子如今已在官网找不见踪影了。

例子非常简单，给出一系列二维的点，通过线性回归，找到最优函数。代码如下：

import tensorflow as tf
import time

# 模型参数【W是斜率，b是截距】
W = tf.Vari...]]></description><category></category></item><item><title><![CDATA[这11条提升Android开发效率的建议你或许用得上]]></title><link>https://blog.youkuaiyun.com/androidchanhao/article/details/79486630</link><guid>https://blog.youkuaiyun.com/androidchanhao/article/details/79486630</guid><author>androidchanhao</author><pubDate>Thu, 08 Mar 2018 16:44:58 +0800</pubDate><description><![CDATA[今天对近1个半月团队开发公司项目的OA功能做了一个总结，主要是反思如何提升工作效率，感悟如下：


善于利用团队成果，不做重复工作；
遇到问题思考无效后，迅速与团队成员沟通；
功能讨论清楚后再开发，否则返工多；
网络请求的request和response打印日志，快速定位问题；
先实现，再优化；
用模拟器测试，极大缩短安装时间；
开发累计一定量后再测试，测试过于频繁太浪费时间；
测试时列清单列表，...]]></description><category></category></item></channel></rss>