C++博客-记

CUDA + Visual Assistant

邹敏 — Fri, 05 Aug 2011 07:34:00 GMT

CUDA SDK helps developers to use GPU computing power to c developers. You may find help in SDK about code coloring in Visual Studio. But i am sure many of you have been searching for intellisense for cu and cuh as c files. Here is my solution.

Add c and cuh extensions to NCB Default C/C++ Extensions key under
HKEY_CURRENT_USER\Software\Microsoft\VisualStudio\9.0\Languages\Language Services\C/C++ path

cite: http://www.wizardsofeast.com/?p=378
Homepage: http://www.zoumin.org/

邹敏 2011-08-05 15:34 发表评论

8 皇后问题

邹敏 — Mon, 27 Sep 2010 09:44:00 GMT

#include <iostream>
using namespace std;
#define QUEEN_NUM 8
int position[QUEEN_NUM];//每一行的皇后放在第几列
int totalNum=0;
void placeQueen(const int row)//放在第几行
{
    if (row>=QUEEN_NUM)
    {
        for (int i=0;i<QUEEN_NUM;i++)
        {
            cout<<position[i]<<" ";
        }
        cout<<endl;
        totalNum++;
        return;//放置完了
    }
    bool canPutHere=true;
    for (int i=0;i<QUEEN_NUM;i++)//检查当前行的每一列是否与前面已经放置的某一个皇后冲突
    {
        canPutHere=true;
        for (int r=0;r<row;r++)//已经放了row-1个皇后
        {
            if (position[r]==i//在同一列
                ||position[r]==i+r-row//在同一对角线上
                ||position[r]==i-(r-row))
            {
                canPutHere=false;
                break;
            }
        }
        if (canPutHere)
        {
            position[row]=i;
            placeQueen(row+1);
        }
    }
}
void main()
{
    placeQueen(0);
    cout<<"Total Num: "<<totalNum<<endl;
}

Homepage: http://www.zoumin.org/

邹敏 2010-09-27 17:44 发表评论

重构二叉树

邹敏 — Sun, 26 Sep 2010 08:01:00 GMT

#include <iostream>
#include <string>
using namespace std;
//重构二叉树
struct NODE
{
    NODE *pLeft;
    NODE *pRight;
    char value;
};
NODE*  Rebuild(string preOrder,string inOrder)
{
    if (preOrder.size()==0)
    {
        return NULL;
    }
    NODE* pRoot=new NODE;
    (pRoot)->value=preOrder[0];

    int root_pos=inOrder.find_first_of(preOrder[0]);//找根节点的位置
    if (root_pos==-1)
    {
        return NULL;
    }
    int left_ele_num=root_pos;
    int right_ele_num=preOrder.size()-left_ele_num-1;//length是字符序列的长度
    pRoot->pLeft=Rebuild(preOrder.substr(1,1+left_ele_num),inOrder.substr(0,left_ele_num));
    pRoot->pRight=Rebuild(preOrder.substr(root_pos+1,right_ele_num),inOrder.substr(root_pos+1,right_ele_num));
    return pRoot;
}
void preOrder(NODE *root)
{
    if (!root)
    {
        return;
    }
    cout<<root->value<<" ";
    preOrder(root->pLeft);
    preOrder(root->pRight);
}
void main()
{
    string preorder="abdcef";
    string inorder="dbaecf";
    NODE *root=Rebuild(preorder,inorder);
    preOrder(root);
    cout<<endl;
}

Homepage: http://www.zoumin.org/

邹敏 2010-09-26 16:01 发表评论

最大的K个数 K Big

邹敏 — Sat, 25 Sep 2010 13:36:00 GMT

int Partition(double *Array,int left,int right)
{
    double pivot=Array[left];
    int i=left;
    double tmp;
    for (int j=left+1;j<=right;j++)
    {
        if (Array[j]<=pivot)
        {
            i++;
            tmp=Array[j];
            Array[j]=Array[i];
            Array[i]=tmp;
        }
    }
    //exchange A[i],pivot
    tmp=Array[left];
    Array[left]=Array[i];
    Array[i]=tmp;
    return i;
}
void K_Big(double* Array,int left,int right,int k,double *dest)//
{
    if (k<=0)
    {
        return;
    }
    if (right-left+1<=k)
    {
        memcpy(dest,&Array[left],sizeof(double)*(right-left+1));
        return;
    }
    int p=Partition(Array,left,right);
    int right_ele_num=right-p;
    if (right_ele_num>=k)//取右边的前k个
    {
        K_Big(Array,p+1,right,k,dest);
    }
    else{
        //取左边的k-right_ele_num-1个，加上中间一个,再加上右边的right_ele_num个
        right_ele_num++;//把中间的一个也加进来了。
        memcpy(&dest[k-right_ele_num],&Array[p],right_ele_num*sizeof(double));
        K_Big(Array,left,p-1,k-right_ele_num,dest);
    }
}
void main()
{
    double A[]={8,4,3,2,6,13,5};
    int n=7;
    //MergeSort(&A[0],0,6);
    //QuickSort(A,0,6);
    //HeapSort(A,7);
    /*for (int i=0;i    {
        cout<    }*/
    double B[5];
    int k=5;
    K_Big(A,0,6,k,B);
    for (int i=0;i<k;i++)
    {
        cout<<B[i]<<endl;
    }
    cout<<endl;
    delete A;
}

Homepage: http://www.zoumin.org/

邹敏 2010-09-25 21:36 发表评论

HeapSort

邹敏 — Mon, 20 Sep 2010 14:12:00 GMT

void AdjustNode(double *Array,int position,int n)//n是数组中元素的个数，position是当前要调整的位置
{

    int left_child=2*(position+1)-1;
    int right_child=2*(position+1);
    if (left_child>=n)
    {
        return;
    }
    double tmp;
    if (Array[position]<Array[left_child])
    {
        tmp=Array[position];
        Array[position]=Array[left_child];
        Array[left_child]=tmp;
        AdjustNode(Array,left_child,n);
    }
    if (Array[position]<Array[right_child])
    {
        tmp=Array[position];
        Array[position]=Array[right_child];
        Array[right_child]=tmp;
        AdjustNode(Array,right_child,n);
    }
}
void HeapSort(double *Array,int n)
{
    for (int i=n/2;i>=0;i--)
    {
        AdjustNode(Array,i,n);
    }
    double tmp;
    for (int i=0;i<n;i++)
    {
        tmp=Array[0];//每次取根节点元素
        Array[0]=Array[n-i-1];//把最后一个元素放到根节点上
        Array[n-i-1]=tmp;//把排好序的数字放到后面
        AdjustNode(Array,0,n-i-1);
    }
}

邹敏 2010-09-20 22:12 发表评论

Quick Sort

邹敏 — Mon, 20 Sep 2010 13:28:00 GMT

Homepage: http://www.zoumin.org/

邹敏 2010-09-20 21:28 发表评论

Merge Sort

邹敏 — Mon, 20 Sep 2010 12:53:00 GMT

#include <stdlib.h>
#include <iostream>
using namespace std;
void MergeSort(double *Array,int left,int right)
{
    if (left>=right)//只有一个元素，不用排序
    {
        return;
    }
    int middle=(left+right)/2;
    MergeSort(Array,left,middle);
    MergeSort(Array,middle+1,right);
    //归并
    int left_pointer=left;
    int right_pointer=middle+1;
    double *mergeArray=new double[right-left+1];
    int new_array_pointer=0;
    while (left_pointer<=middle&&right_pointer<=right)
    {
        if (Array[left_pointer]<=Array[right_pointer])
        {
            mergeArray[new_array_pointer++]=Array[left_pointer++];
        }
        else {
            mergeArray[new_array_pointer++]=Array[right_pointer++];
        }
    }
    //判断一下是那边的数组先读完了
    if (left_pointer<=middle)//右边的先读完了
    {
        memcpy(&mergeArray[new_array_pointer],&Array[left_pointer],(middle-left_pointer+1)*sizeof(double));
    }
    else{//左边的读完了
        memcpy(&mergeArray[new_array_pointer],&Array[right_pointer],(right-right_pointer+1)*sizeof(double));
    }
    memcpy(&Array[left],&mergeArray[0],(right-left+1)*sizeof(double));
    delete mergeArray;
}
void main()
{
    double A[]={2,4,3,8,6,13,5};
    int n=7;
    MergeSort(&A[0],0,6);
    for (int i=0;i<n;i++)
    {
        cout<<A[i]<<" ";
    }
    cout<<endl;
    delete A;
}

邹敏 2010-09-20 20:53 发表评论

Java 高效读文本文件

邹敏 — Sat, 29 May 2010 13:38:00 GMT

1public static String getSource(String fileName) {
2
3        String s="";
4        File file = new File(fileName);
5        Reader reader = null;
6        try {
7            RandomAccessFile rf=new RandomAccessFile(fileName,"r");
8            byte  contents[]=new byte[(int)rf.length()];
9            rf.read(contents, 0, (int)rf.length());
10            s=new String(contents);
11            //s=new String((char[])contents);
12        } catch (Exception e) {
13            e.printStackTrace();
14        }
15        return s;
16    }

Homepage: http://www.zoumin.org/

邹敏 2010-05-29 21:38 发表评论

莫非人生来就是一种越大越孤独的动物

邹敏 — Mon, 26 Apr 2010 12:15:00 GMT

不记得从什么时候开始，常常感觉到孤独。虽然生活在集体之中，虽然有一些朋友，虽然和女朋友相处的很好，但是，总是有一种孤独的心理挥之不去。大概人就是一种越大越孤独的动物吧。。。。。

邹敏 2010-04-26 20:15 发表评论

真害怕有一天会把自己的理想封存

邹敏 — Sun, 04 Apr 2010 02:10:00 GMT

一直梦想着做些实际的事情，因为我感觉中国混的人太多，而真正踏实做事情的太少。然而，女朋友一而再给我提起房子时，我突然间感觉自己某一天可能会封存自己的理想，而为了房子成为奴隶，成为又一个在这个社会上混钱的人。中国，何时能给理想一片沃土。

邹敏 2010-04-04 10:10 发表评论