题目描述：

LeetCode 623. Add One Row to Tree

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node ...

题目描述：

LeetCode 624. Maximum Distance in Arrays

Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the ...

LeetCode Weekly Contest 36是LeetCode举办的第四十一场正式周赛，共4道题目，比赛时长1.5小时。

比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-36/

题解列表：

LeetCode 617. Merge Two Binary Trees

LeetCode 604. Design Compressed String Iterator

LeetCode 611. Valid Triangle Number

LeetCode 616. Add Bold Tag in String

题目描述：

LeetCode 616. Add Bold Tag in String

Given a string s and a list of strings dict, you need to add a closed pair of bold tag <b> and </b> to wrap the substrings in s that exist ...

题目描述：

LeetCode 611. Valid Triangle Number

Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle ...