题目描述:
LeetCode 451. Sort Characters By Frequency
Given a string, sort it in decreasing order based on the frequency of characters.
Example 1:
Input: "tree" Output: "eert" Explanation: 'e' appears twice while 'r' and 't' both appear once. So 'e' ...
LeetCode OJ is a platform for preparing technical coding interviews.
LeetCode 451. Sort Characters By Frequency
Given a string, sort it in decreasing order based on the frequency of characters.
Example 1:
Input: "tree" Output: "eert" Explanation: 'e' appears twice while 'r' and 't' both appear once. So 'e' ...
LeetCode 449. Serialize and Deserialize BST
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network ...
LeetCode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1 ...
Smarking Algorithm Contest 2是LeetCode举办的第十场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/smarking-algorithm-contest-2/
题解列表:
LeetCode 435. Non-overlapping Intervals
LeetCode 444. Sequence Reconstruction
Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the integers from 1 to n, with 1 ≤ n ≤ 104 ...