Code: Select all
int search_insert_position(int arr[], int key) {
int low = 0;
int high = arr.length-1;
int mid = -1;
while (low key) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return (arr[mid] < key) ? mid + 1 : mid;//my code
}
int search_insert_position(int arr[], int key) {
int low = 0;
int high = arr.length-1;
int mid = -1;
while (low key) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return low;// OTHER'S CODE
}
Bitte helfen Sie mir, die Testfälle zu finden, bei denen mein Code fehlschlagen wird.