Can you solve this real interview question? Maximum Product Subarray - Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. E
github:https://github.com/codingtmd/leetcode/blob/master/src/Product%20of%20Array%20Except%20Self.cpp
给定一个整数 n ,返回可表示为两个n位整数乘积的最大回文整数。因为答案可能非常大,所以返回它对1337取余。 示例1: 输入:n = 2输出:987解释:99 x 91 = 9009, 9009 % 1337 = 987 示例2: 输入:n = 1输出:9 提示: 1 <= n <= 8 排序:最热 ...