<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Xd_Yu的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Xd_Yu</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Xd_Yu]]></copyright><item><title><![CDATA[系统：win10  IDE：pycharm  Python版本：2.7  安装第三方插件是报错：  这里写图片描述  报错原因与编码有关，pip把下载的临时文件存放在了用户临时文件中，这个目录一般是C]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/78687715</link><guid>https://blog.csdn.net/Xd_Yu/article/details/78687715</guid><author>Xd_Yu</author><pubDate>Fri, 01 Dec 2017 16:04:48 +0800</pubDate><description><![CDATA[系统：win10 
IDE：pycharm 
Python版本：2.7 
安装第三方插件是报错： 
 
报错原因与编码有关，pip把下载的临时文件存放在了用户临时文件中，这个目录一般是C:\Users\用户名\AppData\Local\Temp，目录名中有中文，显然ascii这种编码是不支持的，因为我的用户名是中文的所以出现了错误，解决方法： 
找到python2.7目录下的Lib文]]></description><category></category></item><item><title><![CDATA[[python]解决Windows下安装第三方插件报错：UnicodeDecodeError: 'ascii' codec can't decode byte 0xcb in position 0:]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/54945665</link><guid>https://blog.csdn.net/Xd_Yu/article/details/54945665</guid><author>Xd_Yu</author><pubDate>Thu, 09 Feb 2017 11:49:58 +0800</pubDate><description><![CDATA[系统：win10  
IDE：pycharm  
Python版本：2.7  
安装第三方插件是报错：  
 
报错原因与编码有关，pip把下载的临时文件存放在了用户临时文件中，这个目录一般是C:\Users\用户名\AppData\Local\Temp，目录名中有中文，显然ascii这种编码是不支持的，因为我的用户名是中文的所以出现了错误，解决方法：  
找到python2.7目录下的Lib文件夹]]></description><category></category></item><item><title><![CDATA[安装第三方库出现 Python version 2.7 required, which was not found in the registry  建立一个文件 register.py 内容如下.]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/53944948</link><guid>https://blog.csdn.net/Xd_Yu/article/details/53944948</guid><author>Xd_Yu</author><pubDate>Fri, 30 Dec 2016 17:05:12 +0800</pubDate><description><![CDATA[安装第三方库出现 Python version 2.7 required, which was not found in the registry建立一个文件 register.py 内容如下. 然后执行该脚本.import sysfrom _winreg import *# tweak as necessary
version = sys.version[:3]
installpath = sys]]></description><category></category></item><item><title><![CDATA[mysql设置编码]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/53647046</link><guid>https://blog.csdn.net/Xd_Yu/article/details/53647046</guid><author>Xd_Yu</author><pubDate>Wed, 14 Dec 2016 21:25:28 +0800</pubDate><description><![CDATA[MySQL 4.1的字符集支持(Character Set Support)有两个方面：字符集(Character set)和排序方式(Collation)。对于字符集的支持细化到四个层次: 服务器(server)，数据库(database)，数据表(table)和连接(connection)。 查看系统的字符集和排序方式的设定可以通过下面的两条命令或mysql> status 。 
mysql>]]></description><category></category></item><item><title><![CDATA[Leetcode题解 396. Rotate Function]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52757081</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52757081</guid><author>Xd_Yu</author><pubDate>Sat, 08 Oct 2016 15:30:38 +0800</pubDate><description><![CDATA[Given an array of integers A and let n to be its length.Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a “rotation function” F on A as follow:F(k) = 0 * Bk[]]></description><category></category></item><item><title><![CDATA[Leetcode题解  321. Create Maximum Number]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52348444</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52348444</guid><author>Xd_Yu</author><pubDate>Sun, 28 Aug 2016 22:35:01 +0800</pubDate><description><![CDATA[Create Maximum Number 
题目描述Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. The relative order of the]]></description><category></category></item><item><title><![CDATA[字符串消消乐]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52344265</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52344265</guid><author>Xd_Yu</author><pubDate>Sun, 28 Aug 2016 11:13:56 +0800</pubDate><description><![CDATA[遇到3个一样的就标记 public static void test(String s) {
        boolean modify = false;
        int len = 0;
        char[] re = new char[s.length()];
        for (int i = 0; i < s.length(); i++) {]]></description><category></category></item><item><title><![CDATA[Leetcode题解 15. 3Sum]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52241796</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52241796</guid><author>Xd_Yu</author><pubDate>Thu, 18 Aug 2016 15:58:28 +0800</pubDate><description><![CDATA[Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain duplic]]></description><category></category></item><item><title><![CDATA[Leetcode题解 120. Triangle]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52235894</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52235894</guid><author>Xd_Yu</author><pubDate>Wed, 17 Aug 2016 23:40:07 +0800</pubDate><description><![CDATA[Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle 
[ 
     [2], 
    [3,4], 
   [6,5,]]></description><category></category></item><item><title><![CDATA[Leetcode题解 122. Best Time to Buy and Sell Stock II]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52228040</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52228040</guid><author>Xd_Yu</author><pubDate>Wed, 17 Aug 2016 09:45:40 +0800</pubDate><description><![CDATA[假设有一个数组，它的第i个元素是一个给定的股票在第i天的价格。设计一个算法来找到最大的利润。你可以完成尽可能多的交易(多次买卖股票)。然而,你不能同时参与多个交易(你必须在再次购买前出售股票)。 
解题思路 
在Best Time to Buy and Sell Stock系列中，和本题最像的是Best Time to Buy and Sell Stock IV 
Best Time to Buy]]></description><category></category></item><item><title><![CDATA[Android中使用Handler造成内存泄露的分析和解决]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52226151</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52226151</guid><author>Xd_Yu</author><pubDate>Tue, 16 Aug 2016 23:45:14 +0800</pubDate><description><![CDATA[什么是内存泄露？ 
Java使用有向图机制，通过GC自动检查内存中的对象（什么时候检查由虚拟机决定），如果GC发现一个或一组对象为不可到达状态，则将该对象从内存中回收。也就是说，一个对象不被任何引用所指向，则该对象会在被GC发现的时候被回收；另外，如果一组对象中只包含互相的引用，而没有来自它们外部的引用（例如有两个对象A和B互相持有引用，但没有任何外部对象持有指向A或B的引用），这仍然属于不可到达，]]></description><category></category></item><item><title><![CDATA[Leetcode题解 219. Contains Duplicate II]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52216102</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52216102</guid><author>Xd_Yu</author><pubDate>Tue, 16 Aug 2016 00:05:44 +0800</pubDate><description><![CDATA[Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.用hashMap]]></description><category></category></item><item><title><![CDATA[Leetcode题解 136. Single Number]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/52180600</link><guid>https://blog.csdn.net/Xd_Yu/article/details/52180600</guid><author>Xd_Yu</author><pubDate>Thu, 11 Aug 2016 10:53:40 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. Find that single one.第一种解法就是《剑指offer》上的，下面是一种通用的解法：public class Solution {
   public static int singleNumber(int[] nums) {]]></description><category></category></item><item><title><![CDATA[Leetcode题解 343. Integer Break]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51970875</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51970875</guid><author>Xd_Yu</author><pubDate>Wed, 20 Jul 2016 18:06:37 +0800</pubDate><description><![CDATA[Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return 1]]></description><category></category></item><item><title><![CDATA[Leetcode题解 347. Top K Frequent Elements]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51969344</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51969344</guid><author>Xd_Yu</author><pubDate>Wed, 20 Jul 2016 16:03:51 +0800</pubDate><description><![CDATA[Given a non-empty array of integers, return the k most frequent elements.For example, 
Given [1,1,1,2,2,3] and k = 2, return [1,2].用桶排序来做最后处理。public class Solution {
    public List<Integer> topKFreque]]></description><category></category></item><item><title><![CDATA[Leetcode题解 268. Missing Number]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51969330</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51969330</guid><author>Xd_Yu</author><pubDate>Wed, 20 Jul 2016 16:02:46 +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.解法一：（用等差数列的做法）public class Solution {]]></description><category></category></item><item><title><![CDATA[Leetcode题解 142. Linked List Cycle II]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51960100</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51960100</guid><author>Xd_Yu</author><pubDate>Tue, 19 Jul 2016 22:23:22 +0800</pubDate><description><![CDATA[Given a linked list, return the node where the cycle begins. If there is no cycle, return null.《程序员面试金典》原题/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode n]]></description><category></category></item><item><title><![CDATA[Leetcode题解 141. Linked List Cycle]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51960089</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51960089</guid><author>Xd_Yu</author><pubDate>Tue, 19 Jul 2016 22:21:50 +0800</pubDate><description><![CDATA[Given a linked list, determine if it has a cycle in it.Follow up: 
Can you solve it without using extra space?解法一：不用任何额外空间去做。/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val]]></description><category></category></item><item><title><![CDATA[Leetcode题解 287. Find the Duplicate Number]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51960029</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51960029</guid><author>Xd_Yu</author><pubDate>Tue, 19 Jul 2016 22:11:28 +0800</pubDate><description><![CDATA[Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, fin]]></description><category></category></item><item><title><![CDATA[Leetcode题解 28. Implement strStr()]]></title><link>https://blog.csdn.net/Xd_Yu/article/details/51940906</link><guid>https://blog.csdn.net/Xd_Yu/article/details/51940906</guid><author>Xd_Yu</author><pubDate>Mon, 18 Jul 2016 12:09:21 +0800</pubDate><description><![CDATA[Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.解法一：（暴力法）public class Solution {
    public static int strStr(String haystack]]></description><category></category></item></channel></rss>