题目描述:
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 ...
最后更新于 .
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 ...
最后更新于 .
LeetCode 409. Longest Palindrome
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
This is case sensitive, for example "Aa"
is not considered a ...
最后更新于 .
LeetCode 408. Valid Word Abbreviation
Given a non-empty string s
and an abbreviation abbr
, return whether the string matches with the given abbreviation.
A string such as "word"
contains only the following valid abbreviations:
["word", "1ord", "w1rd", "wo1d", "wor1" ...
最后更新于 .
LeetCode Weekly Contest 6是LeetCode举办的第五场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-6/
题解列表:
LeetCode 404. Sum of Left Leaves
LeetCode 405. Convert a Number to Hexadecimal
最后更新于 .
LeetCode 407. Trapping Rain Water II
Given an m x n
matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water it is able to trap after raining ...