摘要:You are given a 0-indexed integer array nums and an integer k. You are initially standing at index 0. In one move, you can jump at most k steps forwar 阅读全文
posted @ 2021-02-16 12:05 Review->Improve 阅读(66) 评论(0) 推荐(0) 编辑
摘要:Given a rows * columns matrix mat of ones and zeros, return how many submatrices have all ones. Example 1: Input: mat = [[1,0,1], [1,1,0], [1,1,0]] Ou 阅读全文
posted @ 2021-02-16 06:13 Review->Improve 阅读(89) 评论(0) 推荐(0) 编辑
摘要:Problem Link: C - Mandarin Orange The problem can be converted to as such: Given an array A of positive integers, find out the the maximum product val 阅读全文
posted @ 2021-02-16 01:08 Review->Improve 阅读(11) 评论(0) 推荐(0) 编辑