<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[imloo的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/imloo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; imloo]]></copyright><item><title><![CDATA[Cellular Automata相关matlab代码]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/44090987</link><guid>https://blog.youkuaiyun.com/imloo/article/details/44090987</guid><author>imloo</author><pubDate>Fri, 06 Mar 2015 01:08:49 +0800</pubDate><description><![CDATA[file:life.m

%% 初始化
m = 50;
X = zeros(m,m);
X(25,25) = 1;

   n = [m 1:m-1];
   e = [2:m 1];
   s = [2:m 1];
   w = [m 1:m-1];
   
  % 绘制初始图形
   [i,j] = find(X);
   figure(gcf);
   plothandle = plot(i]]></description><category></category></item><item><title><![CDATA[Code Review]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/17169251</link><guid>https://blog.youkuaiyun.com/imloo/article/details/17169251</guid><author>imloo</author><pubDate>Fri, 06 Dec 2013 16:29:35 +0800</pubDate><description><![CDATA[http://www.programmer.com.cn/1310/]]></description><category></category></item><item><title><![CDATA[Q1.6]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/16343613</link><guid>https://blog.youkuaiyun.com/imloo/article/details/16343613</guid><author>imloo</author><pubDate>Fri, 15 Nov 2013 18:20:30 +0800</pubDate><description><![CDATA[/*Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees.
Can you do this in place?*/
/*
1   2   3   4          1   5  ]]></description><category></category></item><item><title><![CDATA[Q1.5]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/15028211</link><guid>https://blog.youkuaiyun.com/imloo/article/details/15028211</guid><author>imloo</author><pubDate>Sun, 10 Nov 2013 14:52:37 +0800</pubDate><description><![CDATA[/*Write a method to replace all spaces in a string with '%20'.*/
#include 
#include 
#include  
using namespace std;

/*method1*/
string replaceSpace(string s)
{
	int len = s.length();
	int lent = len]]></description><category></category></item><item><title><![CDATA[Q1.4]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/15026745</link><guid>https://blog.youkuaiyun.com/imloo/article/details/15026745</guid><author>imloo</author><pubDate>Sun, 10 Nov 2013 11:08:40 +0800</pubDate><description><![CDATA[/*Write a method to decide if two strings are anagrams or not.*/
/*写一个函数判断两个字符串是否是变位词*/
/*变位词(anagrams)指的是组成两个单词的字符相同,但位置不同的单词.比如abbcd和abcdb就是一对变位词*/

/*method1: 由于组成变位词的字符是一模一样的,所以按照字典序排序后,两个字符串也就相等了]]></description><category></category></item><item><title><![CDATA[Q1.3]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/15026587</link><guid>https://blog.youkuaiyun.com/imloo/article/details/15026587</guid><author>imloo</author><pubDate>Sun, 10 Nov 2013 10:43:55 +0800</pubDate><description><![CDATA[/*Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two
additional variables are fine. An extra copy of the array is n]]></description><category></category></item><item><title><![CDATA[Q1.2]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/14442933</link><guid>https://blog.youkuaiyun.com/imloo/article/details/14442933</guid><author>imloo</author><pubDate>Thu, 07 Nov 2013 01:16:20 +0800</pubDate><description><![CDATA[/*Write code to reverse a C-Style String.(C-String means that "abcd" is represented as five characters, including the null charater.)*/
#include 
#include 
using namespace std;


void swap(char &a, ch]]></description><category></category></item><item><title><![CDATA[Q1.1]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/14425769</link><guid>https://blog.youkuaiyun.com/imloo/article/details/14425769</guid><author>imloo</author><pubDate>Thu, 07 Nov 2013 00:33:09 +0800</pubDate><description><![CDATA[Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures?
实现一个算法来判断一个字符串的字符是否唯一(即没有重复).不能使用额外的数据结构.(即只使用基本的数据结构)


方法1(O(n^2)):]]></description><category></category></item><item><title><![CDATA[给你10分钟时间，根据上排给出十个数，在其下排填出对应的十个数 要求下排每个数都是先前上排那十个数在下排出现的次数]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/12846545</link><guid>https://blog.youkuaiyun.com/imloo/article/details/12846545</guid><author>imloo</author><pubDate>Wed, 23 Oct 2013 12:21:33 +0800</pubDate><description><![CDATA[给你10分钟时间，根据上排给出十个数，在其下排填出对应的十个数，要求下排每个数都是先前上排那十个数在下排出现的次数。   
上排的十个数如下：   
【0，1，2，3，4，5，6，7，8，9】

举一个例子，   
数值: 0,1,2,3,4,5,6,7,8,9   
分配: 6,2,1,0,0,0,1,0,0,0   
0在下排出现了6次，1在下排出现了2次，   
2在下排出现]]></description><category></category></item><item><title><![CDATA[寻找数组中最小的k个数 "利用快速排序的思想"]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/12841217</link><guid>https://blog.youkuaiyun.com/imloo/article/details/12841217</guid><author>imloo</author><pubDate>Fri, 18 Oct 2013 00:33:46 +0800</pubDate><description><![CDATA[主要思想是：类似快速排序的划分方法, N个数存储在数组S中, 再从数组中随机选取一个数X(随机选取枢纽元, 可做到线性期望时间O(N)的复杂度), 把数组划分为Sa和Sb俩部分, Sa<=X<=Sb, 如果要查找的k个元素小于Sa的元素个数, 则返回Sa中较小的k个元素, 否则返回Sa中所有元素+Sb中小的k-|Sa|个元素. 像上述过程一样, 这个运用类似快速排序的partition的快速选择S]]></description><category></category></item><item><title><![CDATA[寻找数组中最小的k个数 "最小堆方法"]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/12832639</link><guid>https://blog.youkuaiyun.com/imloo/article/details/12832639</guid><author>imloo</author><pubDate>Thu, 17 Oct 2013 13:08:49 +0800</pubDate><description><![CDATA[1. 最小堆的调整,插入和删除
一个最小堆，也是完全二叉树，用按层遍历数组表示
(1) 求节点a[n]的子节点的访问方式
(2) 插入一节点的程序 void add_element(int *a, int size, int val);
(3) 删除最小节点的程序


按照数组下标，下标为n的结点，它的子结点下标位2*n+1和2*n+2;
插入结点时，先插入到最后，然后再调整堆;]]></description><category></category></item><item><title><![CDATA[整数顺序文件查找至少出现两次的整数]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/12096507</link><guid>https://blog.youkuaiyun.com/imloo/article/details/12096507</guid><author>imloo</author><pubDate>Fri, 27 Sep 2013 16:57:58 +0800</pubDate><description><![CDATA[《Programming Pearls》
2.2 给定包含4300000000个32位整数的顺序文件，如何找出一个出现至少两次的整数?


【方法一】
思路：考虑两个条件
1.所有的整数都存储在顺序文件中，因此，读取文件的次数将明显影响算法的效率；
2.顺序文件中包含的整数个数为4300000000，如果全部读取放在内存中的话，必须要考虑内存空间因素。
解决方案：
由上面的问题，]]></description><category></category></item><item><title><![CDATA[使用位逻辑运算实现位向量并实现位图排序]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/12087431</link><guid>https://blog.youkuaiyun.com/imloo/article/details/12087431</guid><author>imloo</author><pubDate>Fri, 27 Sep 2013 12:00:12 +0800</pubDate><description><![CDATA[[Programming Pearls]1.2 & 1.3
给定一个整型(32位)数组，输入一个参数i，然后设置数组的i位(bit位)是1，或者对第i位清零，或者探测第i位的值。使用位逻辑运算(例如与、或、移位)来实现位向量。

// 如何使用位逻辑运算(例如与、或、移位)来实现位向量
// 下面的函数使用常量来设置、清除以及测试位值
// 将位图存储在一个整型数组里面

#define B]]></description><category></category></item><item><title><![CDATA[马的走法]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/11395967</link><guid>https://blog.youkuaiyun.com/imloo/article/details/11395967</guid><author>imloo</author><pubDate>Sun, 08 Sep 2013 21:25:30 +0800</pubDate><description><![CDATA[Description

在一个4*5的棋盘上，输入马的起始位置坐标（纵、横），求马能返回初始位置的所有不同走法的总数（马走过的位置不能重复,马走“日”字）。 


Input

多个测试数据。 
每组2个数字

Output

输出不同走法的总数。

Sample Input


2 2





Sample Output


4596
]]></description><category></category></item><item><title><![CDATA[HDU1005]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/10364515</link><guid>https://blog.youkuaiyun.com/imloo/article/details/10364515</guid><author>imloo</author><pubDate>Mon, 26 Aug 2013 21:56:43 +0800</pubDate><description><![CDATA[Problem Description
A number sequence is defined as follows:
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).



Input]]></description><category></category></item><item><title><![CDATA[关于OpenCV中利用函数cvConvert实现图像数据类型转换(8U->16S)]]></title><link>https://blog.youkuaiyun.com/imloo/article/details/7491381</link><guid>https://blog.youkuaiyun.com/imloo/article/details/7491381</guid><author>imloo</author><pubDate>Mon, 23 Apr 2012 21:04:54 +0800</pubDate><description><![CDATA[最近在做毕设，关于矩形NAM表示方法的。刚刚接触opencv，一些函数用得比较生疏。
  解决灰度图像RNAM算法时要标记已编码的矩形范围，我的方法是将其标记为-1，即处理完一个矩形，即用cvSubS(v+1) “v表示原像素值”将矩形框中的像素减到-1。但由于直接读入的图像数据均为8位无符号整型，所以需将其转换为16位有符号整型，这样才能表示负数。
  利用以下代码直接用函数cvConver]]></description><category></category></item></channel></rss>