請(qǐng)問從堆中實(shí)例化，輸出結(jié)果錯(cuò)誤怎么改
#include <iostream>
using namespace std;
class Coordinate
{
? ??
public:
Coordinate()
{
}
// 打印坐標(biāo)的函數(shù)
void printInfo()??
{
? ? cout<<"("<<m_iX<<","<<m_iY<<")"<<endl;
}
public:
int m_iX;
int m_iY;
};
int main(void)
{
//定義對(duì)象數(shù)組
? ?Coordinate *coorArr=new Coordinate[2];
? ? coorArr->m_iX=1;
? ? coorArr->m_iY=2;
? ? coorArr++;
? ? coorArr->m_iX=3;
? ??
? ? coorArr->m_iY=4;
//遍歷數(shù)組，打印對(duì)象信息
for(int i = 0; i < 2; i++)
{
? ??
? ??
coorArr[i].printInfo();
? ? ? ? coorArr--;
}
coorArr++;
delete []coorArr;
coorArr=NULL;
return 0;
}
2021-05-15
int main(void)
{
//定義對(duì)象數(shù)組
? ? Coordinate *coorArr = new Coordinate[2];
? ? coorArr->m_iX = 1;
? ? coorArr->m_iY = 2;
? ? coorArr++;
? ? coorArr->m_iX = 3;
? ? coorArr->m_iY = 4;
? ??
? ? //coorArr[0].m_iX = 1;
? ? //coorArr[0].m_iY = 2;
? ? //coorArr[1].m_iX = 3;
? ? //coorArr[1].m_iY = 4;
//遍歷數(shù)組，打印對(duì)象信息
for(int i = 0; i < 2; i++)
{
coorArr[i].printInfo();
coorArr-=2;
}
coorArr++;
delete []coorArr;
coorArr = NULL;
return 0;
}
循環(huán)里面指針要減2，不過最后結(jié)果會(huì)倒著打印出來。
2021-03-21
?//定義對(duì)象數(shù)組
??? Coordinate *coorArr = new Coordinate[2];
??? coorArr[0].m_iX = 1;
??? coorArr[0].m_iY = 2;
??? coorArr[1].m_iX = 3;
??? coorArr[1].m_iY = 4;
??? //遍歷數(shù)組，打印對(duì)象信息
??? for (int i = 0; i < 2; i++)
??? {
??????? coorArr[i].printInfo();
??? }
??? delete[]coorArr;
??? coorArr = NULL;
??? return 0;
2021-03-21
要用coordinate[0].m_iX ? coordinate[1].m_iX 這樣的才能準(zhǔn)確的給每個(gè)對(duì)象賦值吧 ?