数组创建 与增删改查

int[] arr1 = new int[10];
int[] arr2 = new int[10];

for(int i = 0 ; i < arr.length ; i ++)
   arr[i] = i;

public static int findByElement(int[] arr, int size, int key) {
  for (int i = 0; i < size; i++) {
       if (arr[i] == key)
          return i;
  }
   return -1;
}

public static int addByElementSequence(int[] arr, int size, int element) {
    // Issue 1: Should it be size > arr.length?
    if (size >= arr.length)
        return -1;
        
    // Issue 2: Think about whether it should be index = 0 or size - 1?
    int index = size;
    
    // Find the insertion position for the new element
    // Issue 3: Should it be size - 1 here?
    for (int i = 0; i < size; i++) {
        if (element < arr[i]) {
            index = i;
            break;
        }
    }
    
    // Shift elements to make room for the new element
    // Issue 4: Think about why it's not size - 1 here
    for (int j = size; j > index; j--) {
        arr[j] = arr[j - 1]; // Shift elements starting from index one position to the right
    }
    
    arr[index] = element; // Insert the new element
    return index;
}

public int removeByElement(int[] arr, int size, int key) {
    int index = -1;
    for (int i = 0; i < size; i++) {
        if (arr[i] == key) {
            index = i;
            break;
        }
    }
    if (index != -1) {
        for (int i = index + 1; i < size; i++) {
            arr[i - 1] = arr[i];
        }
        size--;
    }
    return size;
}