题目描述:
LeetCode 416. Partition Equal Subset Sum
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Note:
Both the array ...
LeetCode 416. Partition Equal Subset Sum
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Note:
Both the array ...
IMPORTANT:
Solutions which uses a BigInteger library or converting the input strings to another type (such as integer) will result in disqualification of all submissions to this problem.
After the contest ends, users can view ...
LeetCode Weekly Contest 7是LeetCode举办的第六场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-7/
题解列表:
LeetCode 408. Valid Word Abbreviation
LeetCode 409. Longest Palindrome
LeetCode 411. Minimum Unique Word Abbreviation
A string such as "word" contains the following abbreviations:
["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
Given a target string and a set of ...
LeetCode 410. Split Array Largest Sum
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m ...