摘要：
Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there 阅读全文
posted @ 2020-10-28 14:40
little_veggie
阅读(113)
评论(0)
推荐(0)
摘要：
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following defin 阅读全文
posted @ 2020-10-28 14:09
little_veggie
阅读(116)
评论(0)
推荐(0)
摘要：
Given an m x n matrix. If an element is 0, set its entire row and column to 0. Do it in-place. Follow up: A straight forward solution using O(mn) spac 阅读全文
posted @ 2020-10-28 13:20
little_veggie
阅读(77)
评论(0)
推荐(0)
摘要：
Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree. You may assume each number in the seq 阅读全文
posted @ 2020-10-28 12:50
little_veggie
阅读(103)
评论(0)
推荐(0)
摘要：
Design a HashMap without using any built-in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert 阅读全文
posted @ 2020-10-28 08:45
little_veggie
阅读(96)
评论(0)
推荐(0)
浙公网安备 33010602011771号