题目描述
LeetCode 561. Array Partition I
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum ...
标签归档：leetcode
[LeetCode]Array Partition I
[LeetCode]Binary Tree Tilt
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 563. Binary Tree Tilt
Given a binary tree, return the tilt of the whole tree.
The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the ...
LeetCode Weekly Contest 28解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 28是LeetCode举办的第三十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-28/
题解列表：
LeetCode 551. Student Attendance Record I
LeetCode 553. Optimal Division
[LeetCode]Student Attendance Record II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 552. Student Attendance Record II
Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may be very large, return it after mod 10 ...
[LeetCode]Split Assembled Strings
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 555. Split Assembled Strings
Given a list of strings, you could assemble these strings together into a loop. Among all the possible loops, you need to find the lexicographically biggest string after cutting and making one breakpoint of ...