whl-hl

摘要： 1. 问题描述 Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally ide 阅读全文

摘要： 1. 问题描述 Invert a binary tree. to Tag: Tree /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right 阅读全文

摘要： 1. 问题描述 Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume t 阅读全文

摘要： 1. 问题描述 Given two arrays, write a function to compute their intersection. Example: Note: Each element in the result must be unique.The result can be i 阅读全文

摘要： 1. 问题描述 Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the far 阅读全文

摘要： 1. 问题描述 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example: Given num = 38, the process i 阅读全文

摘要： 1. 问题描述 You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 t 阅读全文

摘要： 1. 问题描述 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.T 阅读全文

摘要： 1. 问题描述 Given two numbers represented as strings, return multiplication of the numbers as a string.Note:The numbers can be arbitrarily large and are n 阅读全文

摘要： 1. 问题描述 Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant di 阅读全文