题解 | #数组元素处理#

#include <iostream>
using namespace std;

void func(int* p, int n);

int main() {

    int arr[6] = { 0 };
    for (int i = 0; i < 6; i++) {
        cin >> arr[i];
    }

    func(arr, 6);

    for (int i = 0; i < 6; i++) {
        if (i == 5) {
            cout << arr[i] << endl;
        }
        else {
            cout << arr[i] << " ";
        }
    }

    return 0;
}

void func(int* p, int n) {

    // write your code here......
      for (int i = 0; i < n; i++) {//遍历找到0
        if (p[i] == 0) {
            for (int j = 0; j < n - i - 1; j++) {//进行n-i-1次循环
                swap(p[i + j], p[i + 1 + j]);//每次循环交换p[i]和p[i+1]的位置并后移交换位
            }
        }
    }

}