题目描述:
LeetCode 406. Queue Reconstruction by Height
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k)
, where h
is the height of the person and k ...
LeetCode 406. Queue Reconstruction by Height
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k)
, where h
is the height of the person and k ...
LeetCode 405. Convert a Number to Hexadecimal
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.
IMPORTANT:
You must not use any method provided by the library which converts ...
LeetCode 404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.
Example:
3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 15 respectively ...
LeetCode Weekly Contest 5是LeetCode举办的第四场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-5/
题解列表:
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must ...