Subarray Sum to K
Given an nonnegative integer array, find a subarray where the sum of numbers is k.
该标签下的全部文章。
Given an nonnegative integer array, find a subarray where the sum of numbers is k.
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.
In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slid
You are given an array of n non-negative integers. Each value means the height of a histogram.
How many paths are there for a robot to go from (0,0) to (x,y), supposing it can only move down and move right