blocks|key|598441|text|您不必销毁您的数组，因为它是由value使用的，并且只使用value+(int)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|598442|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

You don't have to destroy your array, as it is used by value and only uses values (int).

blocks|key|1899174|text|在dtor中不需要做任何事情，因此你不需要写一个。数组对象的内存不是动态分配的。因此，当Heap对象超出作用域时，会自动释放为array分配的内存。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1899175|entityMap^0|18|4|1R|5|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]|$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|M|8|@]|D|@]|E|$]]]|G|$]]

There is nothing needs to be done in the dtor, hence you need not write one. The memory for array object is not allocated dynamically. Hence when the <code>Heap</code> object goes out of scope the memory allocated for <code>array</code> is automatically released.

blocks|key|1899184|text|array不是动态分配的，因此当对象不再存在于作用域中时，它的存储空间就会消失。实际上，您不能将其重新赋值给array；这样做是错误的。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1899185|entityMap^0|0|5|1I|5|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]|$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|M|8|@]|D|@]|E|$]]]|G|$]]

<code>array</code> is not dynamically allocated, so the storage for it goes away when the object no longer exists in scope. In fact, you can't reassign to <code>array</code>; it's an error to do so.

blocks|key|1901280|text|如果你改变类型定义为基于指针的类型，你应该删除数组中的每一个ItemType。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1901281|因此，您可以遍历数组并删除它们|1901282|for+(+int+i+=+0;+i+<+elements;+i%2B%2B+)
++delete+array[i]+//+Supposing+you+created+them+with+new|code-block|syntax|javascript|1901283|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

If you change the typedef to pointer based type you should delete every ItemType of the array. 

So, you can iterate through the array and delete them

<pre><code>for ( int i = 0; i &lt; elements; i++ )
 delete array[i] // Supposing you created them with new
</code></pre>

blocks|key|2073038|text|因为你的数组是静态分配的(例如，没有使用new)，所以析构函数实际上不需要做任何事情-一旦创建的堆超出作用域(如果它是动态创建的，则被显式删除)，数组就会消失。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|2073039|只有在动态分配内存时(例如，在C代码中使用new或malloc()+)，您才需要显式删除(或free())它。|2073040|entityMap^0|K|3|0|L|3|P|8|1A|6|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]|$9|R|A|S|B|C]]|D|@]|E|$]]|$1|H|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|I|$]]

Since your array is allocated statically (ie, without using <code>new</code>), the destructor doesn't actually need to do anything - as soon as the created heap goes out of scope (or is explicitly deleted if it's created dynamically) the array will disappear.

Only when allocating memory dynamically (eg, with <code>new</code> or <code>malloc()</code> in the case of C code) do you need to explicitly delete (or <code>free()</code>) it.

blocks|key|598521|text|C%2B%2B中有两种类型的数组:静态数组和动态数组。它们之间的主要区别在于如何为它们分配内存。静态数组或多或少是由编译器自动创建和销毁的。动态数组需要由程序员创建和销毁。您的对象当前使用静态数组，因此您无需担心它的创建或销毁。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|598522|但是，如果要将数组切换为动态数组，则可以按如下方式更改代码：|598523|typedef+int+ItemType;
ItemType+*array;++//+Pointer+to+location+in+memory+where+the+array+will+reside.

Heap::Heap()
{
++++array+=+new+ItemType[MAX_SIZE];++//+Assign+memory+for+the+array+to+use.
++++elements+=+0;
}

Heap::~Heap()
{
+++delete[]+array;++//+Clear+the+memory+used+by+the+array.
}|code-block|syntax|javascript|598524|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

There are two types of arrays in C++: static and dynamic. The main difference between them lies in how the memory for them is allocated. Static arrays are more or less automatically created and destroyed by your compiler. Dynamic arrays need to be created and destroyed by the programmer. Your object currently uses a static array, so there is no need for you to worry about its creation or destruction.

However, if you want to switch your array to a dynamic array, you could change your code as follows:

<pre><code>typedef int ItemType;
ItemType *array; // Pointer to location in memory where the array will reside.

Heap::Heap()
{
 array = new ItemType[MAX_SIZE]; // Assign memory for the array to use.
 elements = 0;
}

Heap::~Heap()
{
 delete[] array; // Clear the memory used by the array.
}
</code></pre>

blocks|key|665017|text|与原始示例中的数组一样，数组是Heap类的子对象。它由Heap构造函数自动构造，由Heap析构函数自动析构。你不需要做任何事情来构造和/或销毁它。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|665018|entityMap^0|F|4|R|4|15|4|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]|$9|K|A|L|B|C]|$9|M|A|N|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|O|8|@]|D|@]|E|$]]]|G|$]]

Array like in your original example is a subobject of your <code>Heap</code> class. It is constructed automatically by <code>Heap</code> constructors and destructed automatically by <code>Heap</code> destructor. You don't need to do anything to construct and/or destruct it.

<pre><code>#include &lt;cstdlib&gt;
#include &lt;iostream&gt;

using namespace std;

const unsigned long MAX_SIZE = 20;
typedef int ItemType;

class Heap {
private:
 ItemType array[MAX_SIZE];
 int elements; //how many elements are in the heap
public:
 Heap( )
 ~Heap( )
 bool IsEmpty( ) const
 bool IsFull( ) const
 Itemtype Retrieve( ) 
 void Insert( const Itemtype&amp; )
};
</code></pre>

Let's say I have this as my header file. In my implementation for this, what is the best way to do Heap() constructor and ~Heap() destructor.

I have

<pre><code>Heap::Heap()
{
 elements = 0;
}

Heap::~Heap()
{
 array = NULL;
}
</code></pre>

I am wondering if this is the proper way to destruct and construct an array in this case.

how to destruct an array

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

#include <cstdlib>#include <iostream>using namespace std;const unsigned long MAX_SIZE = 20;typedef int ItemType;class Heap {private: ItemType array[MAX_S...

问如何析构数组
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何析构数组EN