1. 滑动窗口一般模板12345678//外层循环扩展右边界，内层循环扩展左边界for (int left = 0, right = 0 ; right < n ; right++) { //当前考虑的元素 while (left <= right && check()) {//区间[left,right]不符合题意 //扩展左边界 } //区间[left,right]符合题意，统计相关信息}
2. 二叉树层序遍历模板C++：12345678910111213141516171819202122class Solution {public: vector<vector<int>> levelOrder(TreeNode* root) { queue<TreeNode*> que; if (root != NULL) que.push(root); vector<vector<i ...
LeetCode
未读1. 【输入输出】普通数组1234567891011121314151617public static void main(String[] args) { //输入 Scanner scanner = new Scanner(System.in); String[] numsStr = scanner.nextLine().split(" "); int[] nums = new int[numsStr.length]; for(int i=0;i<nums.length;i++){ nums[i] = Integer.parseInt(numsStr[i]); } int target = scanner.nextInt(); //解题 int[] result = solution(nums, target); //输出 System.out.println(A ...
