C++博客-三少爷http://www.cppblog.com/sanshaoye/zh-cnTue, 14 Apr 2026 17:18:11 GMTTue, 14 Apr 2026 17:18:11 GMT60一个大的含有50M个URL的记录，一个小的含有500个URL的记录，找出两个记录里相同的URL。http://www.cppblog.com/sanshaoye/archive/2012/08/30/188757.html三少_爷三少_爷Thu, 30 Aug 2012 06:53:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/30/188757.htmlhttp://www.cppblog.com/sanshaoye/comments/188757.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/30/188757.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/188757.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/188757.html#include <iostream>
#include <fstream>
#include <string>
#include <hash_set>
using namespace std;
using namespace stdext;

int main()
{
    hash_set<string> hs;
    hash_set<string>::iterator it;

    ofstream out1("file1.txt");
    ofstream out2("file2.txt");
    out1<<"www.baidu.com"<<endl;
    out1<<"www.google.com"<<endl;
    out1<<"www.sina.com"<<endl;

    out2<<"www.baidu.com"<<endl;
    out2<<"www.yahoo.com"<<endl;
    
    ifstream in1("file1.txt");
    ifstream in2("file2.txt");
    string str1;
    string str2;
    while(getline(in2,str2))
    {
        hs.insert(str2);
    }
    while(getline(in1,str1))
    {
        if((it = hs.find(str1)) != hs.end ())
        {
            cout<<"find: "<<str1<<endl;
        }
    }
    system("pause");
    return 0;
}

三少_爷 2012-08-30 14:53 发表评论
]]>找到满足条件的数组http://www.cppblog.com/sanshaoye/archive/2012/08/30/188751.html三少_爷三少_爷Thu, 30 Aug 2012 06:13:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/30/188751.htmlhttp://www.cppblog.com/sanshaoye/comments/188751.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/30/188751.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/188751.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/188751.html#include <stdio.h>
#include <iostream>
#include <fstream>
#include <string>
#include <stdlib.h>
#include <map>
using namespace std;

int main() 
{ 
    bool b[1000] = {false};
    int temp = 0;
    for(int i = 1; i < 1000; i++)
    {
        temp += i;
        int j = i;
        while(j != 0)
        {
            temp += (j % 10);
            j = j/10;
        }
        if(temp < 1000)
        {
            b[temp] = true;
        }
    }
    for(int i = 1;i < 1000; i++)
    {
        cout<<i<<": "<<b[i]<<endl;
    }

    system("pause");
    return 0;
}

三少_爷 2012-08-30 14:13 发表评论
]]>remove extra spacehttp://www.cppblog.com/sanshaoye/archive/2012/08/26/188305.html三少_爷三少_爷Sun, 26 Aug 2012 01:28:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/26/188305.htmlhttp://www.cppblog.com/sanshaoye/comments/188305.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/26/188305.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/188305.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/188305.html#include <stdio.h>
#include <iostream>
#include <fstream>
#include <string>
#include <stdlib.h>
using namespace std;

char * removeMultipleSpaces(char * str)
{
    int i,j = 0;
    bool in = false;
    for(i = 0; str[i] != '\0'; i++)
    {
        if(str[i] != ' ')
        {
            str[j++] = str[i];
            in = false;
        }
        else
        {
            if(in)
            {
                i++;
            }
            else
            {
                str[j++] = str[i];
                in = true;
            }
        }
    }
    str[j] = '\0';

    return str;
}

int main() 
{ 
    char str[] = "lsjd    lsdk   ksdj   d";
    removeMultipleSpaces(str);
    printf("%s\n",str);
    system("pause");
    return 0;
}

三少_爷 2012-08-26 09:28 发表评论
]]>singleton modelhttp://www.cppblog.com/sanshaoye/archive/2012/08/24/188095.html三少_爷三少_爷Thu, 23 Aug 2012 23:27:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/24/188095.htmlhttp://www.cppblog.com/sanshaoye/comments/188095.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/24/188095.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/188095.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/188095.htmlclass Singleton
{
private:
    static Singleton s;
    int i;
    Singleton(int i)
    {
        this->i = i;
    }
    void operator= (Singleton s)
    {
        s.i = this->i;
    }
    Singleton(Singleton & s)
    {
        this->i = s.i;
    }
public:
    static Singleton & getHandle()
    {
        return s;
    }
    void setValue(int i)
    {
        this->i = i;
    }
    int getValue()
    {
        return i;
    }
};

Singleton Singleton::s(50);

int main() 
{ 
    Singleton &s = Singleton::getHandle();
    printf("%d\n",s.getValue());
    
    system("pause");
    return 0;
}

三少_爷 2012-08-24 07:27 发表评论
]]>reverse a file character to another filehttp://www.cppblog.com/sanshaoye/archive/2012/08/22/187919.html三少_爷三少_爷Wed, 22 Aug 2012 01:04:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/22/187919.htmlhttp://www.cppblog.com/sanshaoye/comments/187919.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/22/187919.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187919.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187919.html#include <stdio.h>
#include <iostream>
#include <fstream>
#include <string>
#include <stdlib.h>
using namespace std;

int main() 
{ 
    ifstream fin("main.cpp");
    ofstream fout("a.cpp");
    string str;
    string filestr;
    char a[100];
    while(getline(fin,str))
    {
        filestr += (str + '\n');
    }
    int i = filestr.size();
    for(int i = filestr.size()-1; i>= 0; i--)
    {
        fout<<filestr[i];
    }

    system("pause");
    return 0;
}

三少_爷 2012-08-22 09:04 发表评论
]]>max sum of subsequencehttp://www.cppblog.com/sanshaoye/archive/2012/08/21/187866.html三少_爷三少_爷Tue, 21 Aug 2012 10:52:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/21/187866.htmlhttp://www.cppblog.com/sanshaoye/comments/187866.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/21/187866.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187866.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187866.html#include <stdio.h>
#include <stdlib.h>

int MaxSubsequenceSum(const int a[], int n)
{
    int currentSum = 0;
    int maxSum = 0;
    for(int i = 0; i < n; i++)
    {
        currentSum += a[i];
        if(currentSum > maxSum)
        {
            maxSum = currentSum;
        }
        if(currentSum < 0)
        {
            currentSum = 0;
        }
    }
    return maxSum;
}
int main() 
{ 
    int a[7] = { 1,-2,3,-6,7,-2,5};
    int b = MaxSubsequenceSum(a,7);
    printf("%d\n",b);

    system("pause");
    return 0;
}

三少_爷 2012-08-21 18:52 发表评论
]]>add two int numbers, check whether overflowedhttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187762.html三少_爷三少_爷Mon, 20 Aug 2012 05:50:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187762.htmlhttp://www.cppblog.com/sanshaoye/comments/187762.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187762.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187762.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187762.html#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <iostream>
using namespace std;

int ifo_add(int a,int b)
{
    __asm{
        mov eax,a
        add eax,b
        jo overflow
        xor eax,eax
        jmp no_overflow
overflow:
        mov eax,1
no_overflow:
    }
}
int main() {
    int a,b;

    a=          1;b= 2;printf("%11d+(%2d)  %d\n",a,b,ifo_add(a,b));
    a=         -1;b=-2;printf("%11d+(%2d)  %d\n",a,b,ifo_add(a,b));
    a= 2147483647;b= 1;printf("%11d+(%2d)  %d\n",a,b,ifo_add(a,b));
    a=-2147483647;b=-1;printf("%11d+(%2d)  %d\n",a,b,ifo_add(a,b));
    a=-2147483647;b=-2;printf("%11d+(%2d)  %d\n",a,b,ifo_add(a,b));

    system("pause");
    return 0;
}

三少_爷 2012-08-20 13:50 发表评论
]]>reverse singly linked listhttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187735.html三少_爷三少_爷Mon, 20 Aug 2012 01:45:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187735.htmlhttp://www.cppblog.com/sanshaoye/comments/187735.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/20/187735.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187735.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187735.html#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <iostream>
using namespace std;

typedef struct Node
{
    int data;
    Node * next;
}Node,*list;

void createList(Node * &head)
{
    if(head == NULL)
    {
        head = (Node *)malloc(sizeof(Node));
        head->data = 1;
        head->next = NULL;
    }

    Node * p = head;
    while(p->next != NULL)
    {
        p = p->next;
    }
    for(int j = 2; j < 10; j++)
    {

        Node * q = (Node *)malloc(sizeof(Node));
        q->data = j;
        q->next = NULL;

        p->next = q;
        p = q;
    }
}
Node * reverse(Node * head)
{
    Node * p,*q,*r;
    if(head == NULL)
        return NULL;
    if(head->next == NULL)
        return head;
    p = head;
    q = head->next;
    while(q)
    {
        r = q->next;
        q->next = p;
        p = q;
        q = r;
    }
    head->next = NULL;
    return p;
}
int main()
{    
    Node * head = NULL;
    createList(head);
    Node * p = head;
    while(p)
    {
        printf("%d  ",p->data);
        p = p->next;
    }
    printf("\n");
    p = reverse(head);
    while(p)
    {
        printf("%d  ",p->data);
        p = p->next;
    }
    printf("\n");
    system("pause");
    return 1;
}

三少_爷 2012-08-20 09:45 发表评论
]]>prime numbershttp://www.cppblog.com/sanshaoye/archive/2012/08/19/187645.html三少_爷三少_爷Sun, 19 Aug 2012 01:14:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/19/187645.htmlhttp://www.cppblog.com/sanshaoye/comments/187645.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/19/187645.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187645.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187645.html#include <stdio.h>
#include <iostream>
using namespace std;

int prime(int n)
{
    int number = 0;
    for(int i = 2; i <= n; i++)
    {
        int j;
        for(j = 2; j < i; j++)
        {
            if((i%j) == 0)
                break;
        }
        if( i == j)
        {
            number++;
        }
    }
    return number;
}

void main()
{
    printf("%d\n",prime(4));
    system("pause");

}

三少_爷 2012-08-19 09:14 发表评论
]]>least calculation time to get 1, if n is odd,add or sub 1,if even divide by one.http://www.cppblog.com/sanshaoye/archive/2012/08/18/187561.html三少_爷三少_爷Sat, 18 Aug 2012 00:57:00 GMThttp://www.cppblog.com/sanshaoye/archive/2012/08/18/187561.htmlhttp://www.cppblog.com/sanshaoye/comments/187561.htmlhttp://www.cppblog.com/sanshaoye/archive/2012/08/18/187561.html#Feedback0http://www.cppblog.com/sanshaoye/comments/commentRss/187561.htmlhttp://www.cppblog.com/sanshaoye/services/trackbacks/187561.html
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <iostream>
using namespace std;
int function(unsigned int n)
{
if( n == 1 ) return 0;
if( (n % 2) == 0) return 1 + function(n/2);
return 2 + min(function(n-1)/2, function(n+1)/2);
}
int main()
{
for(int i = 1; i < 1000; i++)
{
printf("%d\n",function(i));
}
system("pause");
return 1;
}


三少_爷 2012-08-18 08:57 发表评论
]]>