代码随想录_数组

数组

二分查找

代码随想录

lc

视频

收获

左闭右闭不用多说，左闭右开就意味着循环条件为left < right因为(1]并不合法，且初始right = len 因为范围是不包括右节点的

代码(左闭右闭)

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0;
        int right = nums.size() - 1; // 定义target在左闭右闭的区间里，[left, right]
        while (left <= right) { // 当left==right，区间[left, right]依然有效，所以用 <=
            int middle = left + ((right - left) / 2);// 防止溢出 等同于(left + right)/2
            if (nums[middle] > target) {
                right = middle - 1; // target 在左区间，所以[left, middle - 1]
            } else if (nums[middle] < target) {
                left = middle + 1; // target 在右区间，所以[middle + 1, right]
            } else { // nums[middle] == target
                return middle; // 数组中找到目标值，直接返回下标
            }
        }
        // 未找到目标值
        return -1;
    }
};

代码(左闭右开)

class Solution {
public:
int search(vector<int> &nums, int target) {
	int len = nums.size();
	int left = 0, right = len;
	int mid;
	while (left < right) {
		mid = (left + right) >> 1;
		if (nums[mid] == target) return mid;
		if (nums[mid] < target) {
			left = mid + 1;
		} else {
			right = mid;
		}
	}
	return -1;
}
};

移除元素

代码随想录

lc

视频

用法快慢指针

我写的

int removeElement(vector<int> &nums, int val) {
	int new_len = nums.size();
	int slow = 0;
	int fast = 0;
	while (fast < nums.size()) {
		nums[slow] = nums[fast];
		if (nums[slow] != val) slow++;
		fast++;
	}
	return slow;
}

卡尔哥写的

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int slowIndex = 0;
        for (int fastIndex = 0; fastIndex < nums.size(); fastIndex++) {
            if (val != nums[fastIndex]) {
                nums[slowIndex++] = nums[fastIndex];
            }
        }
        return slowIndex;
    }
};

有序数组的平方

代码随想录

lc

视频

快慢指针法，属于想到了很简单，想不到就是想不到的类型

主要思想就是从两边中间做，进行比较，卡尔的图很形象了

vector<int> sortedSquares(vector<int> &nums) {
	int len = nums.size();
	vector<int> res(len,0);
	int i = 0;
	int j = len - 1;
	int idx = len - 1;
	while (i <= j) {
		int left = pow(nums[i], 2);
		int right = pow(nums[j], 2);
		if (left < right) {
			res[idx--] = right;
			j--;
		} else {
			res[idx--] = left;
			i++;
		}
	}
	return res;
}

长度最小的子数组

代码随想录

lc

视频

思想是滑动窗口

代码

int minSubArrayLen(int target, vector<int> &nums) {
	int res = INT_MAX;
	int sum = 0;
	for (int end = 0, start = 0; end < nums.size(); end++) {
		sum += nums[end];
		while (sum >= target) {
			int len = end - start + 1;
			res = res <= len ? res : len;
			sum -= nums[start++];
		}
	}
	return res == INT_MAX ? 0 : res;
}

螺旋矩阵II

代码随想录

lc

视频

不太难，控制好边界值就ok

vector<vector<int>> generateMatrix(int n) {
	vector<vector<int>> arr(n, vector<int>(n, 0));
	int count = 1;
	for (int round = 1; round < n; round++) {
		for (int row = round - 1, colomn = round - 1; colomn < n - round; colomn++) {
			arr[row][colomn] = count++;
		}
		for (int row = round - 1, colomn = n - round; row < n - round; row++) {
			arr[row][colomn] = count++;
		}
		for (int row = n - round, colomn = n - round; colomn > round - 1; colomn--) {
			arr[row][colomn] = count++;
		}
		for (int row = n - round, colomn = round - 1; row > round - 1; row--) {
			arr[row][colomn] = count++;
		}
	}
	if (n % 2 == 1) {
		arr[n / 2][n / 2] = count;
	}
	//for (int i = 0; i < n; i++) {
	//	for (int j = 0; j < n; j++) {
	//		printf("%d ", arr[i][j]);
	//	}
	//	printf("\n");
	//}

	return arr;
}

}
if (n % 2 == 1) {
	arr[n / 2][n / 2] = count;
}
//for (int i = 0; i < n; i++) {
//	for (int j = 0; j < n; j++) {
//		printf("%d ", arr[i][j]);
//	}
//	printf("\n");
//}

return arr;

}