blocks|key|206931|text|C没有数组边界检查。你必须自己去做。使用变量跟踪已插入的项数，并在计数器等于数组大小时停止。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|206932|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|$]]

C has no array bounds check. You have to do it yourself. Use a variable to keep track of how many items you have inserted, and stop when your counter is equal to the array size.

blocks|key|4713027|text|不能检查"array是否已满“。要做你想做的事情，在向数组添加元素的同时跟踪索引。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4713028|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 cannot check if "array is full". To do what u want to do, keep track of index while adding elements to array.

blocks|key|206966|text|您需要跟踪用户插入的数据。当计数器达到数组的大小时，数组已满。:D在C中没有其他方法来实现这个结果，因为它没有提供任何方法来验证数组中有多少个元素。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|206967|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 need to keep track of the data inserted by a user. When your counter reaches the size of the array, the array is full. :D There is not other way in C to achieve this result as it does not provide any means of verifying how many elements are in the array.

blocks|key|4713047|text|引入一个变量来计算填充的单元格的数量。每当向数组中添加/删除数据时，都可以调整此变量。然后，为了检查数组是否已满，只需检查此变量是否等于数组中的单元格总数。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4713048|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|$]]

Introduce a variable for counting the number of cells filled. You adjust this variable whenever you add/remove data to your array. Then, in order to check if your array is full, just check if this variable is equal to the total number of cells in your array.

blocks|key|4713269|text|在我看来，最简单的方法是使用calloc()动态分配内存，您可以将数组元素初始化为例如0。您可以通过检查数组中的最后一个元素是否仍为零来检查数组是否已满。当然，如果最后一个元素仍然是零，那么数组就不是满的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4713270|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|$]]

The most simple way in my opinion is to dynamically allocate memory using calloc(), where you can initialise the array elements to, for example, zeros. The you can check if the array is full by checking, if the last element in the array is still zero or not. Of course, if the last element is still zero, then the array is not full.

blocks|key|4713068|text|首先，这不是一个数组，而是一个矩阵(也就是数组的数组)。你已经知道矩阵的维度是3x3，然后你可以这样做：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4713069|int+x,+y;
int+array[3][3];

for+(x+=+0;+x<2;+x%2B%2B)
{
++++for+(y+=+0;+y<2;+y%2B%2B)
++++{
++++++++//I+assume+that+it+is+an+array+of+int
++++++++printf("Insert+number+at+%25d+-+%25d"+,x,y);
++++++++scanf("%25d"+,&array[x][y]);
++++}
}|code-block|syntax|javascript|4713070|现在用户只能插入3*3=9值。|4713071|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

First of all this is not an array but a matrix (aka array of array). you already know that the matrix has dimensions 3x3 and then you could do something like this:

<pre><code>int x, y;
int array[3][3];

for (x = 0; x&lt;2; x++)
{
 for (y = 0; y&lt;2; y++)
 {
 //I assume that it is an array of int
 printf("Insert number at %d - %d" ,x,y);
 scanf("%d" ,&amp;array[x][y]);
 }
}
</code></pre>

Now the user can only insert 3*3=9 values.

blocks|key|207100|text|在C中没有办法检查数组界限，但是通过更好的编码实践，我们可以检查数组是否已满。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|207101|例如，考虑在您的数组a3中，您不希望有一些特定值。该值可以是任何值！0xFF或0或整数范围内的任何值！您必须确保该值不会作为数组的输入，然后您可以验证数组a3是否已满！|207102|/*part+of+coed+in+main*/
/*here+initialize+the+array+with+0,+assuming+that+0+will+never+be+a+part+of+array+a[3][3]*/
for(i=0;+i<3;+i%2B%2B)
{
++++for(j=0;j<3;j%2B%2B)
++++{
++++++++a[i][j]+=+0;+++//+assuming+that+0+will+never+be+a+part+of+array+a[3][3]
++++}
}

while(CheckArray(**a)!=0)
{
++++printf("give+array+input:\n")
++++scanf("%25d",+&a[row][column]);+//writing+to+empty+cell+of+an+array
}

//CheckArray+code
int+CheckArray(int+a[][])
{
++++for(i=0;+i<3;+i%2B%2B)
++++{
++++++++for(j=0;j<3;j%2B%2B)
++++++++{
++++++++++++if(a[i][j]+==+0)+++//+assuming+that+0+will+never+be+a+part+of+array+a[3][3]
++++++++++++{
++++++++++++++++row+=+i;++++++//+row+and+column+must+be+global+variables+in+this+example!
++++++++++++++++column+=+j;+++//+row+and+column+must+be+global+variables+in+this+example!
++++++++++++++++return+1;
++++++++++++}
++++++++++++else
++++++++++++{
++++++++++++++++//+no+need+to+do+anything+here
++++++++++++}
++++++++}
++++}

++++//if+code+reaches+here+then+array+is+full!
++++printf("Array+is+full.\n");
++++return+0;
}|code-block|syntax|javascript|207103|你仍然可以优化上面的代码！这只是通过更好的编码实践来检查数组是否已满的一种方法！|207104|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|O|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|P|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

There are no way to array bound check in C, However with better coding practice we check whether array is full.

For example, consider in your array a[3][3] you don't want to have some particular value. That value could be anything! 0xFF or 0 or anything which is in the integer range! and you have to make sure that value is never given as the input to the array, and then you can verify whether your array a[3][3] is full!

<pre><code>/*part of coed in main*/
/*here initialize the array with 0, assuming that 0 will never be a part of array a[3][3]*/
for(i=0; i&lt;3; i++)
{
 for(j=0;j&lt;3;j++)
 {
 a[i][j] = 0; // assuming that 0 will never be a part of array a[3][3]
 }
}

while(CheckArray(**a)!=0)
{
 printf("give array input:\n")
 scanf("%d", &amp;a[row][column]); //writing to empty cell of an array
}

//CheckArray code
int CheckArray(int a[][])
{
 for(i=0; i&lt;3; i++)
 {
 for(j=0;j&lt;3;j++)
 {
 if(a[i][j] == 0) // assuming that 0 will never be a part of array a[3][3]
 {
 row = i; // row and column must be global variables in this example!
 column = j; // row and column must be global variables in this example!
 return 1;
 }
 else
 {
 // no need to do anything here
 }
 }
 }

 //if code reaches here then array is full!
 printf("Array is full.\n");
 return 0;
}
</code></pre>

You can still optimize the above code! this is just one way of checking whether array is full with better coding practice!

blocks|key|207166|text|如果可能，您可以将数组中的所有元素初始化为程序认为“非法”或“无效”的特定值。例如，正数组可以被初始化为全1，或者字符数组可以被初始化为全空字符。然后，如果最后一个元素被设置为默认值，那么只需查看它。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|207167|measurement+=+sizeof(myarray)+/+sizeof(element);+//or+just+a+constant
while(myarray[measurement-1]+==+defaultvalue){
+++//insert+code+here...
}|code-block|syntax|javascript|207168|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

If possible, you could initialize all elements in the array to a certain value that your program would otherwise consider "illegal" or "invalid". E.g. an array of positive numbers can be initialized to be all -1's. Or an array of chars can be initialized to be all NULL characters.
Then, just look at the last element if it is set to the default value.

<pre><code>measurement = sizeof(myarray) / sizeof(element); //or just a constant
while(myarray[measurement-1] == defaultvalue){
 //insert code here...
}
</code></pre>

blocks|key|4713362|text|您可以假设数组的最后一个元素具有id=0。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|4713363|然后在function+add中检查是否有带id=0的元素。|4713364|int+add(char+*source,+char+*target,+int+size)+{
++++int+index+=+0;
++++for+(int+i+=+0;+i+<+size;+i%2B%2B)+{
++++++++if+(target[i].id+==+0)+{
++++++++++++index+=+i;
++++++++++++break;
++++++++}
++++}

++++if+(index+>=+0+&&+index+<+size)+{

++++++++if+(index+<+size+-+1)+target[index+%2B+1].id+=+0;
//+check+that+element+with+id=0+is+the+last+in+the+array

++++++++//write+code+to+add+your+element+here

++++++++return+index;
++++}+
}|code-block|syntax|javascript|4713365|entityMap^0|G|4|0|C|3|M|4|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|R|8|@$9|S|A|T|B|C]|$9|U|A|V|B|C]]|D|@]|E|$]]|$1|H|3|I|5|J|7|W|8|@]|D|@]|E|$K|L]]|$1|M|3|-4|5|6|7|X|8|@]|D|@]|E|$]]]|N|$]]

You can assume that the last element of an array has <code>id=0</code>.
Then in function <code>add</code> check if there is an element with <code>id=0</code>.
<pre><code>int add(char *source, char *target, int size) {
 int index = 0;
 for (int i = 0; i &lt; size; i++) {
 if (target[i].id == 0) {
 index = i;
 break;
 }
 }

 if (index &gt;= 0 &amp;&amp; index &lt; size) {

 if (index &lt; size - 1) target[index + 1].id = 0;
// check that element with id=0 is the last in the array

 //write code to add your element here

 return index;
 } 
}
</code></pre>

I have an array: array[3][3]

I will let the user input data into the array as long as it is not full. As soon as the array gets full I want to stop the user from inserting more data into it.

C how do I check if an array is full?

我有一个数组: array3只要数组没有填满，我就让用户将数据输入到数组中。数组一满，我就想阻止用户向其中插入更多数据。

问C如何检查数组是否已满？
EN

回答 9

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问C如何检查数组是否已满？EN

回答 9

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问C如何检查数组是否已满？
EN