<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kingoverlord的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/kingoverlord</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; kingoverlord]]></copyright><item><title><![CDATA[const c++]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/41784375</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/41784375</guid><author>kingoverlord</author><pubDate>Sun, 07 Dec 2014 03:37:47 +0800</pubDate><description><![CDATA[#include 
using namespace std;

class A{

public :
	int cc;
	const int iii(){
		return 10;
	}
	void iiri() const {
		//cc = 100;
	}
};

int main(){
	int a = 10;
	int *p1;
	p1 = &a;
	cout << "*p = " <<]]></description><category></category></item><item><title><![CDATA[jumper longest path --pending--]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/40979189</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/40979189</guid><author>kingoverlord</author><pubDate>Mon, 10 Nov 2014 12:38:29 +0800</pubDate><description><![CDATA[额]]></description><category></category></item><item><title><![CDATA[recursive function time complexity analysis]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/40584111</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/40584111</guid><author>kingoverlord</author><pubDate>Wed, 29 Oct 2014 11:47:19 +0800</pubDate><description><![CDATA[Big-Oh for Recursive Functions: Recurrence Relations
It's not easy trying to determine the asymptotic complexity (using big-Oh) of recursive functions without an easy-to-use but underutilized tool. T]]></description><category></category></item><item><title><![CDATA[DP extension Object]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/40491939</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/40491939</guid><author>kingoverlord</author><pubDate>Mon, 27 Oct 2014 01:17:23 +0800</pubDate><description><![CDATA[#include 
using namespace std;
#include 
#include 
//#include "Source2.c"
class Role{
};

class Isubject{
public :
	virtual Role * GetExtension(string name){
		return NULL;
	}
	virtual void addExtesni]]></description><category></category></item><item><title><![CDATA[电话 Num]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/40472611</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/40472611</guid><author>kingoverlord</author><pubDate>Sun, 26 Oct 2014 05:13:06 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
// numsize = 3; e: 3 9 
/*
	0 1 2 4 5 6 7 8 
    0 1 2 4 5 6 7 8 
	0 1 2 4 5 6 7 8
*/
bool inVecor(int k, vector excludeNum){
	for (auto a : excludeNum){
		if ]]></description><category></category></item><item><title><![CDATA[dark corners of C++]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/39267089</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/39267089</guid><author>kingoverlord</author><pubDate>Sun, 14 Sep 2014 07:38:49 +0800</pubDate><description><![CDATA[http://ecs.syr.edu/faculty/fawcett/handouts/CSE687/presentations/DarkCorners.pdf]]></description><category></category></item><item><title><![CDATA[Set Matrix zeroes]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/38957149</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/38957149</guid><author>kingoverlord</author><pubDate>Sun, 31 Aug 2014 05:26:05 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

class Solution {
   public:
      void setZeroes(vector > &matrix) {// reference is needed;
        
        size_t colNum = matrix[0].size();//n
        size]]></description><category></category></item><item><title><![CDATA[for m*n*k   unequal - col - multi array still works ; pick one from a1 a2 a3]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/38456729</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/38456729</guid><author>kingoverlord</author><pubDate>Sat, 09 Aug 2014 15:12:17 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
void getShowdowlist(vector rwlst, vector &slst, int i){
	int k = 0;

	while (i)
	{
		slst[k] = (i%rwlst[k]);
		i = i / rwlst[k];
		k++;
	}
}
void get]]></description><category></category></item><item><title><![CDATA[rolling array ; triangle; from end to beginning add ； No aftereffect]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/38310271</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/38310271</guid><author>kingoverlord</author><pubDate>Thu, 31 Jul 2014 02:41:10 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector getRow(int k) {
    vector vts;
    if(k == 0){
        vts.push_back(1);
        return vts;
    }
    if(k == 1){
        vts.push_back(1);
        vts.]]></description><category></category></item><item><title><![CDATA[remove target element from arrary  AC]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/34035897</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/34035897</guid><author>kingoverlord</author><pubDate>Tue, 24 Jun 2014 07:25:38 +0800</pubDate><description><![CDATA[class Solution {
public:
    int removeElement(int A[], int n, int elem) {
        int i = 0;
        int num = 0;
        // suppose a general conditions;
        // and then apply for the specific c]]></description><category></category></item><item><title><![CDATA[Remove Duplicates from Sorted List  =AC=]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/32711823</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/32711823</guid><author>kingoverlord</author><pubDate>Fri, 20 Jun 2014 15:04:50 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.]]></description><category></category></item><item><title><![CDATA[New - low - high boundary; kind of binary search]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/32238961</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/32238961</guid><author>kingoverlord</author><pubDate>Thu, 19 Jun 2014 04:47:57 +0800</pubDate><description><![CDATA[class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        int length = n;
        int mid = 0;
        int first = 0;
        
        while(length)
        {
            int]]></description><category></category></item><item><title><![CDATA[link 2005 - static memeber]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/23500665</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/23500665</guid><author>kingoverlord</author><pubDate>Sat, 12 Apr 2014 04:06:13 +0800</pubDate><description><![CDATA[if one .h file has the static int member;
then add this on every .cpp file which include this .h file




if you do not]]></description><category></category></item><item><title><![CDATA[copy construct can up spread;]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/22982851</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/22982851</guid><author>kingoverlord</author><pubDate>Sat, 05 Apr 2014 12:47:06 +0800</pubDate><description><![CDATA[#include 
using namespace std;
class t3
{
public:
t3()
{
cout 
}
t3(t3 &t22)
{
cout 
}
};
class t2
{
int k;
t3 t33;
public:
t2()
{
cout 
}
/*t2(t2 &t22)
{
cout 
}*/
};


]]></description><category></category></item><item><title><![CDATA[lower_bound upper bound 2]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/22555187</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/22555187</guid><author>kingoverlord</author><pubDate>Sun, 30 Mar 2014 02:52:36 +0800</pubDate><description><![CDATA[#include 

using namespace std;
int my_lower_bound(int *array, int size, int key)
{
	int first = 0, last = size - 1;
	int middle, pos = 0;       //需要用pos记录第一个大于等于key的元素位置

	while (first < last)
	{
		m]]></description><category></category></item><item><title><![CDATA[lower_bound upper bound]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/22553841</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/22553841</guid><author>kingoverlord</author><pubDate>Sun, 30 Mar 2014 02:40:26 +0800</pubDate><description><![CDATA[#include 

using namespace std;
int my_lower_bound(int *array, int size, int key)
{
	int first = 0, last = size - 1;
	int middle, pos = 0;       //需要用pos记录第一个大于等于key的元素位置

	while (first < last)
	{
		m]]></description><category></category></item><item><title><![CDATA[sqlite]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/21951159</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/21951159</guid><author>kingoverlord</author><pubDate>Mon, 24 Mar 2014 13:34:00 +0800</pubDate><description><![CDATA[http://wenku.baidu.com/view/b31e841614791711cc791709.html]]></description><category></category></item><item><title><![CDATA[Search Insert Position  - 2b 解法]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/21442591</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/21442591</guid><author>kingoverlord</author><pubDate>Tue, 18 Mar 2014 09:30:28 +0800</pubDate><description><![CDATA[class Solution {
public:
int getMid(int a, int b)
{
	return (a + b) / 2;
}
int aux(int A[], int start, int end, int target)
{
	int mid = getMid(start, end);
	if (start>end)
	{
		//if (start == end) //]]></description><category></category></item><item><title><![CDATA[create table]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/20981869</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/20981869</guid><author>kingoverlord</author><pubDate>Tue, 11 Mar 2014 05:25:53 +0800</pubDate><description><![CDATA[CellInfo]]></description><category></category></item><item><title><![CDATA[thought methods]]></title><link>https://blog.youkuaiyun.com/kingoverlord/article/details/20981249</link><guid>https://blog.youkuaiyun.com/kingoverlord/article/details/20981249</guid><author>kingoverlord</author><pubDate>Tue, 11 Mar 2014 05:13:51 +0800</pubDate><description><![CDATA[1 = every word say out should be solid; 
2 = tell them why;
I can not identify because;
I guess because;




3 = put something unknown into the known questions 
4 = exclude something through ]]></description><category></category></item></channel></rss>