题目 Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area. 给定一个矩阵中,只有0和1,求出这个矩阵的一个最大的子矩阵,其中只包含1. 例如 01101 11010 01110 11110 1
题目链接 滑动窗口思想,注意分清起始位置和终止位置 class Solution {public int minSubArrayLen(int target, int[] nums) {int result = Integer.MAX_VALUE;// 起始位置用于向后移动int i = 0;// 滑动窗口长度int len = 0;// 滑动窗口数值之和int sum = 0;// j表示终