将元素插入数组

本文介绍了将元素插入数组的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

如何使用inset方法以正确的顺序将数字添加到数组中？

How can I make an inset method that will add a number into the array in the correct order?

void addElement(int table[], int element, int length) { int x = 0; int temporary=0; cout<<length<<endl; if(length == 1) { table[0] = element; } else { if(length == 2) { if (table[0] > element) { int temp = table[0]; table[0] = element; table[1] = temp; } else { table[1] = element; } } else { for(int i = 0; i< length && x == 0; i++) { if(element<table[i] && element>=table[i-1]) { for(int y = i; y<length; y++) { temporary = table[y+2]; int temp = table[y]; table[y] = element; table[y+1] = table } } } } } }

这是我已经得到的。在我的主类中，我已经工作，所以数组增加1.所以在数组的末尾有一个开放空间，所有东西都被推回1。

This is as far as I have gotten. In my main class I have worked it out so that array is increased by 1. So there is one open space at the end of the array for everything to be pushed back by 1.

推荐答案

您可以从后向前扫描数组，将值向上移动直到找到正确的插入点。

You can scan the array from back to front, moving values up until you find the correct insertion point.

void addElement(int *table, int element, int length) { int i = length - 1; for (; i > 0 && table[i-1] > element; --i) { table[i] = table[i-1]; } table[i] = element; }