请问在C++中如何定义一个动态数组？及一些链表的问题

[xiaoxiongxyz]

请问在C++中如何定义一个动态数组？
如果不用MFC怎么链表？

[wbh0360]

例：
int *p=new int(5);//开辟5个int空间

[sevecol]

链表的问题，可以使用STL里面的。

[zhang,qiuping]

如果不用MFC怎么链表？
你说的是单链表吗？
//example如果是想知道更多，则应看一下数据结构。
#include <iostream>
#include <conio.h>
using namespace std;

struct student
{
char name[20];
long id;
float score;
student *pNext;
};
student *pHead;
student *create(void)
{
student *pStart;
student *pEnd;
pStart=new student;
cout<<"请输入Id,Name,Score:"<<endl;
cin>>pStart->id>>pStart->name>>pStart->score;
pHead=NULL;
pEnd=pStart;
while(pStart->id!=0)
{
if(NULL==pHead)
{
pHead=pStart;
}
else
{
pEnd->pNext=pStart;
}
pEnd=pStart;
pStart=new student;
cout<<"请输入Id,Name,Score:"<<endl;
cin>>pStart->id >>pStart->name >>pStart->score ;
}//end of while
pEnd->pNext=NULL;
delete pStart;//因为在跳出循环前，pStart被多分配了一个新的空间，所以要回收！
return pHead;
}

void Print(student *head)
{
cout<<"List the items:"<<endl;
while(head!=NULL)
{
cout<<"ID:"<<head->id <<" "<<"Name:"<<head->name <<" Score:"<<head->score <<endl;
head=head->pNext;
}//end of while
}

void main()
{
Print(create());
getch();
}

[mynick]

用STL里的vector。
另，二楼有错，()应为[]

[yzb1000]

#include <iostream.h>
enum boolean{FALSE, TRUE};
template <class T>
struct Node{
T val;
Node *next;
};
template <class T>
class List{
Node<T> *head;
int size;
public:
List()
{
head = NULL;
size = 0;
}
virtual boolean Insert(T val);
boolean Empty();
boolean Delete(T val);
boolean Contains(T val);
void Print();
~List();
};
template <class T>
List<T>::~List()
{
Node<T> *temp;
for (Node<T> *p = head; p;){
temp = p;
p = p->next;
delete temp;
}
}

template <class T>
boolean List<T>::Empty()
{
if (head)
return FALSE;
else
return TRUE;
}
template <class T>
boolean List<T>::Insert(T x)
{
Node<T> *node = new Node<T>;
if (node){
node->val = x;
node->next = head;
head = node;
size++;
return TRUE;
}
return FALSE;
}

template <class T>
boolean List<T>::Delete(T x)
{
Node<T> *temp;
if (Empty())
return FALSE;
if (head->val == x){
temp = head->next;
delete head;
size--;
head = temp;
return TRUE;
}
for (Node<T> *p = temp = head; p; temp = p, p = p->next)
if (p->val == x){
temp->next = p->next;
delete p;
size--;
return TRUE;
}
return FALSE;
}

template <class T>
boolean List<T>::Contains(T x)
{
for (Node<T> *p = head; p; p = p->next)
if (p->val == x)
return TRUE;
return FALSE;
}

template <class T>
void List<T>::Print()
{
for (Node<T> *p = head; p ; p = p->next)
cout << p->val << " ";
cout << "\n";
}

void main()
{
List<int> intlist;
int i;
for (i = 0; i < 10; i++)
intlist.Insert(i);
intlist.Print();
intlist.Delete(1);
intlist.Delete(2);
intlist.Print();

List<float> floatlist;
floatlist.Insert(3.1);
floatlist.Insert(1.5);
floatlist.Print();

List<char *> charlist;
charlist.Insert("program.");
charlist.Insert("my ds ");
charlist.Insert("is ");
charlist.Insert("This ");
charlist.Print();
}
http://expert.csdn.net/Expert/topic/2059/2059607.xml?temp=.5858118

[yzb1000]

二维数组p[M][N]
int **p;
p=new int *[M];
for(int i=0;i<5;i++)
p[i]=new int[N];

[shishiXP]

自己写个可扩展链表

或用stl里的<vector>