LeetCode Weekly Contest 38是LeetCode举办的第四十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-38/
题解列表：
LeetCode 628. Maximum Product of Three Numbers
LeetCode 630. Course Schedule III
档案日期2017的25
2017年6月19日 - 2017年6月25日
LeetCode Weekly Contest 38解题报告
[LeetCode]Design Excel Sum Formula
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 631. Design Excel Sum Formula
Your task is to design the basic function of Excel and implement the function of sum formula. Specifically, you need to implement the following functions:
Excel(int H, char W): This is the ...
[LeetCode]K Inverse Pairs Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 629. K Inverse Pairs Array
Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs.
We define an inverse pair as following ...
[LeetCode]Course Schedule III
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 630. Course Schedule III
There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be taken continuously for t days ...
[LeetCode]Maximum Product of Three Numbers
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 628. Maximum Product of Three Numbers
Given an integer array, find three numbers whose product is maximum and output the maximum product.
Example 1:
Input: [1,2,3] Output: 6
Example 2:
Input: [1,2,3,4] Output ...