daniel456 - 博客园

2017年10月21日

摘要： 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 farthest l 阅读全文

posted @ 2017-10-21 17:37 daniel456 阅读(128) 评论(0) 推荐(0) 编辑

100. Same Tree

摘要： 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 identical a 阅读全文

posted @ 2017-10-21 17:14 daniel456 阅读(75) 评论(0) 推荐(0) 编辑

437. Path Sum III

摘要： You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文

posted @ 2017-10-21 17:13 daniel456 阅读(118) 评论(0) 推荐(0) 编辑

2017年10月20日

645. Set Mismatch

摘要： The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another n 阅读全文

posted @ 2017-10-20 21:53 daniel456 阅读(128) 评论(0) 推荐(0) 编辑

400. Nth Digit

摘要： Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... Note:n is positive and will fit within the range of a 32-bi 阅读全文

posted @ 2017-10-20 21:43 daniel456 阅读(133) 评论(0) 推荐(0) 编辑

633. Sum of Square Numbers

摘要： Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c. Example 1: Example 2: 阅读全文

posted @ 2017-10-20 21:13 daniel456 阅读(106) 评论(0) 推荐(0) 编辑

507. Perfect Number

摘要： We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given an integer n, write 阅读全文

posted @ 2017-10-20 21:04 daniel456 阅读(147) 评论(0) 推荐(0) 编辑

453. Minimum Moves to Equal Array Elements

摘要： Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n 阅读全文

posted @ 2017-10-20 21:00 daniel456 阅读(115) 评论(0) 推荐(0) 编辑

441. Arranging Coins

摘要： You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number 阅读全文

posted @ 2017-10-20 20:53 daniel456 阅读(197) 评论(0) 推荐(0) 编辑

415. Add Strings

摘要： Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. Note: 求两个字符串的加法阅读全文

posted @ 2017-10-20 20:42 daniel456 阅读(100) 评论(0) 推荐(0) 编辑

andywu

公告