摘要:
There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one way to travel between two different cities (this network form a tr 阅读全文
posted @ 2020-06-01 09:45
Schwifty
阅读(337)
评论(0)
推荐(0)
摘要:
Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1). Ex 阅读全文
posted @ 2020-06-01 09:16
Schwifty
阅读(192)
评论(0)
推荐(0)
摘要:
Given a rectangular cake with height h and width w, and two arrays of integers horizontalCuts and verticalCuts where horizontalCuts[i] is the distance 阅读全文
posted @ 2020-06-01 09:15
Schwifty
阅读(318)
评论(0)
推荐(0)

浙公网安备 33010602011771号