An array is a collection of the same type of data stored in a continuous memory space. The corresponding data under the subscript can be obtained through subscript indexing.
As an example (character array)~
You can see:
1. The subscript of the array starts from 0
2. The addresses of arrays in memory are consecutive
, so when deleting elements, you can only use overwriting.
For example, if you want to delete the element with index 2~, you need to move the elements after 2 to the previous one in order, covering the element to be deleted.
So deleting an element does not release the space of the element, but the space behind it. Move the elements to the front, overwrite the elements to be deleted, and then subtract 1 from the length of the array to get a seemingly new array.
In java, the storage method of two-dimensional array is as follows:
Likou question link: Binary search
The premise of this question is an ordered array, because once there are repeated elements, the element subscript returned by the binary search method may not be unique. These are all using Prerequisites for dichotomy.
The idea of binary search is:
Under the premise that the array is ordered (assuming ascending order), if the value in the middle of the array is greater than the value to be found, then the element to be found cannot be in the second half Part, because the values in the second half are greater than the middle value, so through the first comparison, the range can be reduced by half. The same applies later, that is, the time complexity is reduced to O(logN), and the efficiency is greatly improved. When the question When the time complexity of finding elements is required to be O(logN), first think about whether it can be divided into two parts?
class Solution {
public int search(int[] nums, int target) {
// 避免当 target 小于nums[0] nums[nums.length - 1]时多次循环运算
if (target < nums[0] || target > nums[nums.length - 1]) {
return -1;
}
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + ((right - left) >> 1);
if (nums[mid] == target)
return mid;
else if (nums[mid] < target)
left = mid + 1;
else if (nums[mid] > target)
right = mid - 1;
}
return -1;
}
}Some students may have said that you can just delete the redundant elements? But you must know that the elements of the array are continuous in the memory address. You cannot delete an element in the array individually, you can only overwrite it.
For example: I give you an array and a val value, and you are required to delete the elements in the array that are equal to the val value. How to do this?
Idea 1: Brutal method
We can use two for loops. When traversing to an element equal to the val value, move the entire following element forward to cover the element to be deleted. element, but this approach obviously has too high time complexity.
class Solution {
public int removeElement(int[] nums, int val) {
int size = nums.length;
for (int i = 0; i < size;i++ ) {
if (nums[i] == val) { // 发现需要移除的元素，就将数组后面集体向前移动一位
for (int j = i + 1; j < size; j++) {
nums[j - 1] = nums[j];
}
i--; // 因为下标i以后的数值都向前移动了一位，所以i也向前移动一位
size--;
}
}
return size;
}
}Idea 2: Double pointer method
Set up a fast and slow pointer respectively, slow fast, and the two move together. When the slow pointer encounters the element to be deleted, it stops and waits for it to be deleted. Delete (overwrite); when the fast pointer reaches the element to be left, assign the element of the fast pointer to the slow pointer, and then the two pointers move backward at the same time until the fast pointer traverses the entire array.
It can be understood like this: define the new length of the array newLength, starting from 0, define a fast pointer to traverse the array fast, when fast reaches the element to be left, it means that the element should be added to the new array (that is, it is added to the newLength subscript, which is equivalent to the part of the array before newLength being regarded as the new array to be returned, which is equivalent to inserting elements into this new array).
class Solution {
public int removeElement(int[] nums, int val) {
int fast = 0;// 定义一个快指针遍历数组
int newLength = 0;// 定义新的数组长度
while(fast < nums.length){
if(nums[fast] != val){
nums[newLength++] = nums[fast];
}
fast++;
}
return newLength;
}
}Recommended questions
1. Delete duplicates in the sorted array
2. Move zeros
3. Compare characters containing backspaces String
4. The square of an ordered array
Many other common array test points are based on these two points. They are nothing more than adding, deleting, modifying, and checking the array, and mastering the search and deletion of the array. , you can start answering questions.
The above is the detailed content of Java array high-frequency test point example analysis. For more information, please follow other related articles on the PHP Chinese website!