题目描述：
LeetCode 769. Max Chunks To Make Sorted (ver. 1)
Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individually sort each chunk. ...
归档 2018
[LeetCode]Max Chunks To Make Sorted (ver. 1)
[LeetCode]Reorganize String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 767. Reorganize String
Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.
If possible, output any possible result. If not possible ...
[LeetCode]Toeplitz Matrix
作者是
发布于
在
LeetCode.
题目描述：
A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.
Now given an M x N matrix, return True if and only if the matrix is Toeplitz.
Example 1:
Input ...
LeetCode Weekly Contest 67解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 67是LeetCode举办的第七十一场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-67/
题解列表：
LeetCode 762. Prime Number of Set Bits in Binary Representation
LeetCode 763. Partition Labels
[LeetCode]Couples Holding Hands
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 765. Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A ...