题目描述:
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 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 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 ...
书影博客收到了来自如下热心读者的捐赠,在此向您表示衷心的感谢!
您的慷慨捐赠将用于支付书影博客的运营开销。
微信捐赠:
转账单号***169817 ¥30.00 2018年3月14日 转账单号***408662 ¥ 1.00 2018年3月1日 转账单号***280048 ¥ 5.00 2018年1月21日 转账单号***105296 ¥30.00 2017年12月16日 转账单号***470216 ¥10.00 2017年11月15日 转账单号***905737 ¥30.00 2017年10月23日 转账单号***867455 ¥10 ...
LeetCode Weekly Contest 37是LeetCode举办的第四十二场正式周赛,共4道题目,比赛时长1.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-37/
题解列表:
LeetCode 624. Maximum Distance in Arrays
LeetCode 623. Add One Row to Tree
Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be done ...