摘要：
题目如下： Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise X 阅读全文
posted @ 2020-06-22 14:26
seyjs
阅读(366)
评论(0)
推荐(0)
摘要：
题目如下： Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements. Example 1: Input: a 阅读全文
posted @ 2020-06-22 14:22
seyjs
阅读(286)
评论(0)
推荐(0)
摘要：
题目如下： Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Inp 阅读全文
posted @ 2020-06-22 14:18
seyjs
阅读(584)
评论(0)
推荐(0)
摘要：
题目如下： 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 for 阅读全文
posted @ 2020-06-22 14:11
seyjs
阅读(371)
评论(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 di 阅读全文
posted @ 2020-06-22 14:04
seyjs
阅读(373)
评论(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]- 阅读全文
posted @ 2020-06-22 14:01
seyjs
阅读(355)
评论(0)
推荐(0)
浙公网安备 33010602011771号