题目描述：
LeetCode 548. Split Array with Equal Sum
Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions:
- 0 < i, i + 1 < j, j + 1 < k ...
归档 2017
[LeetCode]Split Array with Equal Sum
[LeetCode]Friend Circles
作者是
发布于
在
LeetCode.
题目描述：
There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is ...
[LeetCode]Longest Uncommon Subsequence II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 522. Longest Uncommon Subsequence II
Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence ...
[LeetCode]Longest Uncommon Subsequence I
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 521. Longest Uncommon Subsequence I
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of ...
LeetCode Weekly Contest 25解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 25是LeetCode举办的第三十场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-25/
题解列表：
LeetCode 537. Complex Number Multiplication