C++博客-apple-随笔分类-C++

回文

文殊广法 — Sun, 15 Aug 2010 08:08:00 GMT

#include <iostream>
#include <string.h>
using namespace std;
bool is_equal(char str[])
{
int len=strlen(str);
if (len==0)
return false;
else if (len%2==0)
{
int mid=len/2;
bool flag=true;
int i,j;
for(i=0, j=len-1;  i<mid; i++,j--)
{
if (str[i]==str[j])
  continue;
else
{
flag=false;
break;
}
}
return flag;
}
else
return false;
}
int main()
{
char str[]="helleh";
int return_val;
if (is_equal(str))
   return_val=1;
   else
   return_val=0;
   cout<<return_val<<endl;
}

文殊广法 2010-08-15 16:08 发表评论

有序多项式相加-------------数据结构复习

文殊广法 — Thu, 12 Aug 2010 15:23:00 GMT

//有序多项式加法
#include <iostream>
using namespace std;
struct Node
{
int coef;
int exp;
Node *next;
};
class MExpression
{
private :
Node *first;
public :
MExpression();
void InsertNode(int coef,int exp);
void DeleteNode(int exp);
void Add(MExpression me);
void PrintAll();
};
MExpression::MExpression()
{
first->next=NULL;
}
void MExpression::InsertNode(int coef,int exp)
{
Node *s=new Node();
Node *p=first;
while(p->next!=NULL)
p=p->next;
s->coef=coef;
s->exp=exp;
s->next=p->next;
p->next=s;
}
void MExpression::DeleteNode(int exp)
{
Node *p=first->next;
Node *q;
q=first;
while(p!=NULL)
{
if (p->exp==exp) break;
  q=p;
p=p->next;
}
q->next=p->next;
delete p;
}
void MExpression::Add(MExpression me)
{
int i=0,j=0;
Node *p=first->next;
Node *q=me.first->next;
Node *pp,*qq;
pp=first;
qq=me.first;
while(p&&q)
{
  if (p->exp>q->exp)
  {
  InsertNode(q->coef,q->exp);
  q=q->next;
  }
  else if(p->exp==q->exp)
  {
  p->coef+=q->coef;
  p=p->next;
  q=q->next;
  }
  else
  {
  p=p->next;
  }
}
while(q)
{
  InsertNode(q->coef,q->exp);
  q=q->next;
  }
}
void MExpression::PrintAll()
{
cout<<"=== coef c exp e ==="<<endl;
Node *p=first->next;
while(p!=NULL)
{
cout<<p->coef<<"  c "<<p->exp<<" e ";
p=p->next;
}
}
int main()
{
MExpression *me1=new MExpression();
MExpression *me2=new MExpression();
me1->InsertNode(1,1);
me1->InsertNode(2,2);
me1->InsertNode(3,3);
me1->InsertNode(4,4);
me2->InsertNode(1,2);
me2->InsertNode(2,3);
me2->InsertNode(3,4);
me2->InsertNode(4,5);
me1->Add(*me2);
me1->PrintAll();
}

文殊广法 2010-08-12 23:23 发表评论

循环双链表----数据结构复习

文殊广法 — Thu, 12 Aug 2010 12:36:00 GMT

/*
循环双链表
*/

#include <iostream>
using namespace std;
struct Node
{
int data;
Node *next;
Node *prior;
};

class CycleDLList
{
private :
Node *first;
public:
CycleDLList();
void InsertNode(int data);
void DeleteNode(int data);
void PrintAll();
};

CycleDLList::CycleDLList()
{
first->prior=first;
first->next=first;
}
void CycleDLList::InsertNode(int data)
{
Node *s=new Node();
s->data=data;
Node *p=first->next;
  while(p->next!=first)
  {
   p=p->next;
  }
  s->prior=p;
  s->next=p->next;
  p->next->prior=s;
  p->next=s;
}
void CycleDLList::DeleteNode(int data)
{
Node *p=first->next;
Node *q;
while(p!=first)
{
if(p->data==data) break;
q=p;
p=p->next;
}
if (p!=first)
{
q->next=p->next;
p->next->prior=q;
delete p;
}
}
void CycleDLList:: PrintAll()
{
Node *p=first->next;
Node *q=first->prior;
cout<<"p=p->next"<<endl;
while(p!=first)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<endl;
cout<<"q=q->prior"<<endl;
while(q!=first)
{
cout<<q->data<<" ";
q=q->prior;
}
}
int main()
{
CycleDLList *cd=new CycleDLList();
cd->InsertNode(5);
cd->InsertNode(4);
cd->InsertNode(3);
cd->InsertNode(2);
cd->PrintAll();
cd->DeleteNode(2);
cd->PrintAll();

}

文殊广法 2010-08-12 20:36 发表评论

循环单链表----复习数据结构

文殊广法 — Mon, 09 Aug 2010 06:58:00 GMT

1#include <iostream>
2using namespace std;
3
4struct Node
5 {
6  int data;
7  Node *next;
8 };
9 class CycleLinkList
10  {
11   private :
12   Node *first;
13   public :
14   CycleLinkList();
15   void InsertNode(int data);
16   void DeleteNode(int data);
17   void PrintAll();
18   };
19
20   CycleLinkList:: CycleLinkList()
21   {
22    first=first->next;
23   }
24   void CycleLinkList::InsertNode(int data)
25   {
26   Node *s=new Node();
27   s->data=data;
28   Node *p=first;
29   if (p->next==first)
30   {
31   s->next=first->next;
32   first->next=s;
33   }
34   else
35   {
36   while(p->next!=first) p=p->next;
37   s->next=p->next;
38   p->next=s;
39   }
40   }
41
42   void CycleLinkList::DeleteNode(int data)
43   {
44   Node *p=first->next;
45   Node *q=first->next;
46   while(p!=first)
47   {
48    if (p->data==data) break;
49    else
50    {
51    q=p;
52    p=p->next;
53    }
54   }
55   q->next=p->next;
56   delete p;
57   }
58   void CycleLinkList:: PrintAll()
59   {
60   Node *p=first->next;
61
62   while(p!=first)
63   {
64   cout<<p->data<<"  ";
65   p=p->next;
66   }
67   }
68   int main()
69   {
70   CycleLinkList *cl=new CycleLinkList();
71   cl->InsertNode(3);
72   cl->InsertNode(4);
73   cl->InsertNode(5);
74   cl->InsertNode(6);
75   cl->PrintAll();
76   cl->DeleteNode(4);
77   cl->PrintAll();
78   }

文殊广法 2010-08-09 14:58 发表评论

简单题：：斐波那契数列

文殊广法 — Sun, 07 Sep 2008 07:29:00 GMT

计算出1/1 + 2/1 + 3/2 + 5/3 + 8/5 + 13/8 + .....一直到第n项的和，
每项的分子分母是由斐波那契数列中取相邻的两个得到，计算结果保留三位小数

#include <iostream>
#include <iomanip>
using namespace std;
int main(){

    int n;
    double t;
    while(cin>>n){
    double a=1;
    double b=1;
    double sum=0;
        for(int i=1;i<=n;i++){
        sum+=a/b;
        t=a;
        a+=b;
        b=t;

    }cout<<setiosflags(ios::fixed)<<setprecision(3);
    cout<<sum<<endl;
    }

    return 0;
}

文殊广法 2008-09-07 15:29 发表评论

循环移位

文殊广法 — Sun, 07 Sep 2008 04:54:00 GMT

#include <iostream>
#include <string>
using namespace std;
const int Max=100;
char *sreverse(char *s,int a,int b)
{
  char e;
  char c;
if(b>a)
{
  c=s[a];
  e=s[b];
  s[a]=e;
  s[b]=c;
  a++;
  b--;
  sreverse(s,a,b);
}
  return s;
}
int main()
{ int i;
char *a=new char[Max];
char *p;
cin>>a;
cin>>i;
if(i==0) cout<<a<<endl;
else if(i<0){
    i=-i;
   sreverse(a,0,i-1);
   sreverse(a,i,strlen(a)-1);
   p=sreverse(a,0,strlen(a)-1);
   cout <<p<<endl;
}
else { sreverse(a,strlen(a)-i,strlen(a)-1);
       sreverse(a,0,strlen(a)-i-1);
       p=sreverse(a,0,strlen(a)-1);
   cout <<p<<endl;

}
return 0;
}

能不能进行优化啊，超时！！！

文殊广法 2008-09-07 12:54 发表评论

回文数字的判断

文殊广法 — Sat, 06 Sep 2008 01:26:00 GMT

#include <iostream>
using namespace std;

int Rev(int n){
    char ch;
    if(n>10000) ch='a';
    else if(n>1000) ch='b';
    else if(n>100) ch='c';
    else if(n>10) ch='d';
    else if(n>0) ch='e';
    else return 1;
    switch(ch){
        case 'a':if((n/10000)==(n%10)&&((n%10000)/1000)==((n%100)/10)) return 1;
                 else return 0;
                 break;
        case 'b':if((n/1000)==(n%10)&&((n%1000)/100)==((n%100)/10)) return 1;
                 else return 0;break;
        case 'c': if((n/100)==(n%10)) return 1;
                 else return 0;break;
        case 'd': if((n/10)==(n%10)) return 1;
                 else return 0;break;
        case 'e': return 0;
    } return 0;
}
  int main()
  { cout<<Rev(654);
      cout<<Rev(12321);
      cout<<Rev(322);
      return 0;
  }

文殊广法 2008-09-06 09:26 发表评论

简单链队列

文殊广法 — Fri, 05 Sep 2008 15:16:00 GMT

#include <iostream>
using namespace std;

struct Node{
  int data;
  Node *next;
};

  class Linkqueue{
   public:
     Linkqueue();
     ~Linkqueue();
     void Enqueue(int x);
     int Dequeue();
     int Getqueue();
   private:
     Node *front;
     Node *rear;
};
  Linkqueue::Linkqueue(){
     Node *s;
     s=new Node;
     s->next=NULL;
     front = rear=s;
}
  Linkqueue::~Linkqueue(){
     Node *p;
     p=new Node;
    while(front!=rear){
     p=front->next;
     p->next=front->next;
     delete front;
     front=p;
    }
  }
void Linkqueue::Enqueue(int x){
     Node *s;
     s=new Node;
      s->data=x;
      s->next=NULL;
      rear->next=s;
      rear=s;
}
int Linkqueue::Dequeue(){
      if(front==rear) throw "error";
      Node *p;
      p=new Node;
      p=front->next;
      int x=p->data;
      front->next= p->next;
      if(p->next=NULL) rear=front;
      delete p;
       return  x;
}
  int Linkqueue::Getqueue(){
      return front->next->data;
}
  void main()
{
    Linkqueue q;
   q.Enqueue(2);
   cout<<q.Getqueue()<<endl;
   q.Enqueue(3);
   q.Enqueue(4);
   cout<<q.Dequeue()<<endl;
   cout<<q.Getqueue();
}

文殊广法 2008-09-05 23:16 发表评论

简单顺序栈

文殊广法 — Sun, 31 Aug 2008 03:02:00 GMT

#include <iostream>
using namespace std;
const int MAX=100;
class Seqstack{
public:
  int Gettop();
  void Push(int x);
  Seqstack();
private:
   int top;
   int data[MAX];
};
  Seqstack::Seqstack(){
  top=-1;
}
  void Seqstack::Push(int x){
   cout<<"enter a number:"<<endl;
   cin>>x;
   data[++top]=x;
   cout<<top<<endl;
}
   int Seqstack::Gettop(){
   int x;
   x=data[top];
  cout<<x;
   return 0;
}
  void main()
{
  Seqstack s;
  s.Push(5);
  s.Push(4);
  s.Gettop();
}

文殊广法 2008-08-31 11:02 发表评论

简单单链表

文殊广法 — Sat, 30 Aug 2008 05:08:00 GMT

#include <iostream>
using namespace std;
struct Node{
  int data;
  Node *next;
};
  class Linklist{
    public:
     Linklist(int a[],int n);
     int Get(int x);
    private:
    Node *first;
};
  Linklist::Linklist(int a[],int n){
       first =new Node;
       first->next=NULL;//初始化空链表
       Node *s;
       for( int i=0;i<n;i++)
    {
       s=new Node;
       s->data=a[i];
       s->next=first->next;
        first->next=s;
      }
  }
  int Linklist::Get(int x){
       Node *s;
       s=new Node;
       s=first->next;
       int j=1;
       while(s->data!=x)
      { s=s->next;
         j++;
    }if(s)
    return j;
}
   void main()
{  int a[]={1,2,3,4,5};
   Linklist s(a,5);
     cout<< s.Get(3);
}

文殊广法 2008-08-30 13:08 发表评论

简单顺序表

文殊广法 — Fri, 29 Aug 2008 07:58:00 GMT

#include <iostream>
using namespace std;
const int Max=100;

class Seqlist{

   public:
  Seqlist(int a[],int n);
void Get(int i);
  private:
  int length;
  int b[Max];
};
  Seqlist::Seqlist(int a[],int n)
  {
      for(int i=0;i<n;i++)
      {
      b[i]=a[i];
      cout<<b[i]<<"  ";
    }
        length=n;
}
void Seqlist::Get(int x){

for(int i=0;i<length;i++)
  {
if(x==b[i])
   { cout<<i;
}
else
{
}
}
  }
void main()
{ int n;
  int *a;
   int x;

  cout<<"please enter two number:"<<endl;
  cin>>n;
cin>>x;
  a=new int[n];
  cout<<"enter "<<n<<" numbers:";
for(int i=0;i<n;i++)
  cin>>a[i];
  Seqlist s(a,n);
  s.Get(x);
}

文殊广法 2008-08-29 15:58 发表评论