一:Minimum Size Subarray Sum(最小長度子數組的和O(N)) 題目: Given an array of?n?positive integers and a positive integer?s, find the minimal length of a subarray of which the sum ≥?s. If there isn't one, return 0 instead.
題目: ? Given a?m?x?n?grid filled with non-negative numbers, find a path from top left to bottom right which?minimizes?the sum of all numbers along its path. Note:?You can only move either down or right at any point in time. 題意從左上到右下,
題目 Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? 翻譯 給一個整形,判斷它是否是3的冪 你能不用遞歸或者循環嗎? 一開始沒讀懂題,以為判斷一個數是否