<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Stay hungry，Stay foolish]]></title><description><![CDATA[求知若渴，虚心若愚]]></description><link>https://blog.youkuaiyun.com/ks_is_fighting</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ks_is_fighting]]></copyright><item><title><![CDATA[2015年360校招笔试题]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/48477249</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/48477249</guid><author>ks_is_fighting</author><pubDate>Tue, 15 Sep 2015 22:43:40 +0800</pubDate><description><![CDATA[两道大题，就第一题稍微有点难度，第二题小儿科。 
第一题： 
给出一个整数，分解素因数，并以计算器显示的数字形式打印出来，乘号用*表示 
例如： 
输入： 10 
输出：  
 -   -  
| | 
 - * -  
|     |思路：质因数分解及代码参考：质因数分解及代码代码：import java.util.*;
public class Main {
    public static]]></description><category></category></item><item><title><![CDATA[leetcode:Populating Next Right Pointers in Each Node]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46587037</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46587037</guid><author>ks_is_fighting</author><pubDate>Mon, 22 Jun 2015 02:03:48 +0800</pubDate><description><![CDATA[题目Populating Next Right Pointers in Each Node 
Given a binary treestruct TreeLinkNode {
  TreeLinkNode *left;
  TreeLinkNode *right;
  TreeLinkNode *next;
}
Populate each next pointer to point to its n]]></description><category></category></item><item><title><![CDATA[leetcode(145):Binary Tree Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46585677</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46585677</guid><author>ks_is_fighting</author><pubDate>Sun, 21 Jun 2015 23:35:17 +0800</pubDate><description><![CDATA[题目Binary Tree Postorder Traversal 
Given a binary tree, return the postorder traversal of its nodes’ values.For example: 
Given binary tree {1,#,2,3}, 
   1 
    \ 
     2 
    / 
   3 
return [3,2,1].]]></description><category></category></item><item><title><![CDATA[leetcode(94):Binary Tree Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46583983</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46583983</guid><author>ks_is_fighting</author><pubDate>Sun, 21 Jun 2015 20:41:36 +0800</pubDate><description><![CDATA[题目Binary Tree Inorder Traversal 
Given a binary tree, return the inorder traversal of its nodes’ values.For example: 
Given binary tree {1,#,2,3}, 
   1 
    \ 
     2 
    / 
   3 
return [1,3,2].思路二叉]]></description><category></category></item><item><title><![CDATA[leetcode(144):Binary Tree Preorder Traversal]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46582007</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46582007</guid><author>ks_is_fighting</author><pubDate>Sun, 21 Jun 2015 15:21:37 +0800</pubDate><description><![CDATA[题目Binary Tree Preorder Traversal 
Given a binary tree, return the preorder traversal of its nodes’ values.For example: 
Given binary tree {1,#,2,3}, 
   1 
    \ 
     2 
    / 
   3 
return [1,2,3].思路]]></description><category></category></item><item><title><![CDATA[leetcode:Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574839</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574839</guid><author>ks_is_fighting</author><pubDate>Sat, 20 Jun 2015 19:12:54 +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?

我的解法

想到bitmap的解法，但是在具体实现上还是出现了问题，我的纠结点如下：


如果获取int的位数？我一开始理解，在64bit和32bit系统中，int]]></description><category></category></item><item><title><![CDATA[leetcode:Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574781</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574781</guid><author>ks_is_fighting</author><pubDate>Sat, 20 Jun 2015 18:08:15 +0800</pubDate><description><![CDATA[题目链接：Excel Sheet Column Number Related to question: Excel Sheet Column Title 
Given a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1
B -> 2
C -> 3
.]]></description><category></category></item><item><title><![CDATA[leetcode：Excel Sheet Column Title]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574569</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46574569</guid><author>ks_is_fighting</author><pubDate>Sat, 20 Jun 2015 17:27:27 +0800</pubDate><description><![CDATA[题目Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A
2 -> B
3 -> C
...
26 -> Z
27 -> AA
28 -> AB 
我的解法这个其实就是一个进制的转换，相当于将十进制转换为26进制，可以参考 
Leet]]></description><category></category></item><item><title><![CDATA[leetcode：Same Tree]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46536933</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46536933</guid><author>ks_is_fighting</author><pubDate>Wed, 17 Jun 2015 18:45:20 +0800</pubDate><description><![CDATA[题目Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.我的解法首先想到遍历，同时对两棵树]]></description><category></category></item><item><title><![CDATA[Leetcode:Single Number]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46535897</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46535897</guid><author>ks_is_fighting</author><pubDate>Wed, 17 Jun 2015 17:16:02 +0800</pubDate><description><![CDATA[题目Given an array of integers, every element appears twice except for one. Find that single one.Note: 
Your algorithm should have a linear runtime complexity. Could you implement it without using extra]]></description><category></category></item><item><title><![CDATA[Leetcode：Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46535425</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/46535425</guid><author>ks_is_fighting</author><pubDate>Wed, 17 Jun 2015 16:41:33 +0800</pubDate><description><![CDATA[题目Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,−5,4], 
the contiguous subarray[4,−1,2,1]has the]]></description><category></category></item><item><title><![CDATA[Leetcode：Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45169657</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45169657</guid><author>ks_is_fighting</author><pubDate>Tue, 21 Apr 2015 14:01:17 +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 co]]></description><category></category></item><item><title><![CDATA[Leetcode：Remove Element]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45168443</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45168443</guid><author>ks_is_fighting</author><pubDate>Tue, 21 Apr 2015 11:41:59 +0800</pubDate><description><![CDATA[题目描述Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.]]></description><category></category></item><item><title><![CDATA[《C程序设计语言》--字符数组的应用]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45074239</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/45074239</guid><author>ks_is_fighting</author><pubDate>Thu, 16 Apr 2015 13:46:20 +0800</pubDate><description><![CDATA[最近在看算法书，然后刷题的时候发现，很基本的C语言语法有些遗忘，于是开始读K&R的C语言书，都说很经典，一直也没看过，借此复习一下。 
今天读到字符数组一节，文章举了一个例子。读完题目后，我没有看代码，自己敲了一遍，结果漏洞百出。想想也是学了好多年了，连最基本的编程题目都做成这样，可见基础太不牢固。最后，是在书上给出的代码的参考下，完善了自己的代码。这里就贴一下代码实现吧！题目描述读入一组文本行，并]]></description><category></category></item><item><title><![CDATA[选择问题——选出第K个最大的元素]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/44903237</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/44903237</guid><author>ks_is_fighting</author><pubDate>Mon, 06 Apr 2015 16:42:22 +0800</pubDate><description><![CDATA[最近在读《数据结构与算法分析（C语言描述）》，在优先队列（堆）一节中，作者总结了关于“选择问题——求第k个最大的元素”的几种思路，在此简单总结一下：第一种将这NN个数读进一个数组中，再通过某种简单的算法，比如冒泡排序、选择排序等，以递减顺序将数组进行排序，然后返回位置kk上的元素。假设使用最简单的排序算法，则运行时间为O(N2)O(N^2)第二种这是对第一种算法的简单优化。申请一个大小为kk的数组，]]></description><category></category></item><item><title><![CDATA[更改CloudStack中KVM平台的Windows虚拟机默认磁盘类型为VirtIO]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40617923</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40617923</guid><author>ks_is_fighting</author><pubDate>Thu, 30 Oct 2014 14:32:10 +0800</pubDate><description><![CDATA[前言

本文的目的是为了解决在使用CloudStack（CloudPlatform）时，基于KVM虚拟化平台，Windows虚拟机的性能低下的问题。

此性能，主要指磁盘IO和网卡性能。




相关文档

由于CS文档中，只强调了PV这个概念，根据PV模式区分使用不同的硬件接口类型。所以收集部分链接给大家扫盲。

关于PV（Paravirtualization-半虚拟化]]></description><category></category></item><item><title><![CDATA[virtio驱动分析之libvirt层的参数配置]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40540731</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40540731</guid><author>ks_is_fighting</author><pubDate>Tue, 28 Oct 2014 15:44:20 +0800</pubDate><description><![CDATA[一直在研究kvm的para-virtualization driver - virtio，可能是太熟的原因吧，今天突然发现不知道咋在libvirt层配置kvm采用virtio驱动了，问题在于，看到下面这个配置文件，我竟不能确定此配置是否是采用了virtio驱动，先来看下配置文件的virtio相关的部分：



disk type='file' device='disk'>

    s]]></description><category></category></item><item><title><![CDATA[Rails执行数据库回滚时报错：ActiveRecord::IrreversibleMigration exception]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40392505</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40392505</guid><author>ks_is_fighting</author><pubDate>Thu, 23 Oct 2014 10:57:46 +0800</pubDate><description><![CDATA[最近在rails3.2下修改数据库表的字段，然后想回滚取消操作，但是在执行rake db:rollback命令时，出现错误：]]></description><category></category></item><item><title><![CDATA[How to create columns like "bigint" or "longtext" in Rails migrations]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40353227</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/40353227</guid><author>ks_is_fighting</author><pubDate>Tue, 21 Oct 2014 22:05:03 +0800</pubDate><description><![CDATA[Rails understands a :limit options when you create columns in a migration. Its meaning depends
 on the column type, and sometimes the supplied value.

The
 documentation states that :limit sets th]]></description><category></category></item><item><title><![CDATA[配置KVM下windows虚拟机使用virtio驱动]]></title><link>https://blog.youkuaiyun.com/ks_is_fighting/article/details/38358793</link><guid>https://blog.youkuaiyun.com/ks_is_fighting/article/details/38358793</guid><author>ks_is_fighting</author><pubDate>Sun, 03 Aug 2014 17:29:25 +0800</pubDate><description><![CDATA[一、virtiod的介绍：
（参考官方文档：http://docs.fedoraproject.org/en-US/Fedora/13/html/Virtualization_Guide/chap-Virtualization-KVM_Para_virtualized_Drivers.html）]]></description><category></category></item></channel></rss>