Week 3 (Mar 25)

15. 3Sum

Question

Given an integer array nums, return all the triplets

$[nums[i],nums[j],nums[k]]$ such that

$i\ne j$,

$i\ne k$, and

$j\ne k$, and

$nums[i]+nums[j]+nums[k]==0$.

Notice that the solution set must not contain duplicate triplets.

Hand in homework before Saturday.

Woody的作業
Allen的作業
Wen的作業
xander的作業
Roger的作業
…Continue filling by yourself

662. Maximum Width of Binary Tree

Question

Given the

$root$ of a binary tree, return the maximum width of the given tree.

The maximum width of a tree is the maximum width among all levels.

The width of one level is defined as the length between the end-nodes (the leftmost and rightmost non-null nodes), where the null nodes between the end-nodes that would be present in a complete binary tree extending down to that level are also counted into the length calculation.

It is guaranteed that the answer will in the range of a 32-bit signed integer.

Hand in homework before Saturday.

Woody的作業
Allen的作業
Wen的作業 leetCode runtime error
xander的作業
Roger的作業
…Continue filling by yourself