2016年8月14日
[LeetCode] NO. 349 Intersection of Two Arrays
摘要： [题目] Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. [题目解析] 这是一个很简单的 阅读全文
posted @ 2016-08-14 18:01 三刀 阅读(151) 评论(0) 推荐(0)
[LeetCode] NO. 283 Move Zeroes
摘要： [题目] Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example 阅读全文
posted @ 2016-08-14 16:25 三刀 阅读(113) 评论(0) 推荐(0)
[LeetCode] NO.383 Ransom Note
摘要： [题目] Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the 阅读全文
posted @ 2016-08-14 15:44 三刀 阅读(556) 评论(0) 推荐(0)
[LeetCode] NO.226 Invert Binary Tree
摘要： [题目] Invert a binary tree. to 阅读全文
posted @ 2016-08-14 14:03 三刀 阅读(147) 评论(0) 推荐(0)
[LeetCode] NO.104 Maximum Depth of Binary Tree
摘要： [题目] 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 farth 阅读全文
posted @ 2016-08-14 13:35 三刀 阅读(142) 评论(0) 推荐(0)