摘要: Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 阅读全文
posted @ 2018-10-11 13:58 一丝清风一抹红尘 阅读(112) 评论(0) 推荐(0) 编辑
摘要: Given two arrays, write a function to compute their intersection. Example 1: Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [9,4] Exam 阅读全文
posted @ 2018-10-11 13:40 一丝清风一抹红尘 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. E 阅读全文
posted @ 2018-10-11 12:21 一丝清风一抹红尘 阅读(90) 评论(0) 推荐(0) 编辑
摘要: 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. Example: Note: 阅读全文
posted @ 2018-10-11 11:44 一丝清风一抹红尘 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) Yo 阅读全文
posted @ 2018-10-11 11:22 一丝清风一抹红尘 阅读(103) 评论(0) 推荐(0) 编辑
摘要: Invert a binary tree. Example: Input: Output: 阅读全文
posted @ 2018-10-10 12:29 一丝清风一抹红尘 阅读(112) 评论(0) 推荐(0) 编辑
摘要: A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. Now given an M x N matrix, return True if and only if the m 阅读全文
posted @ 2018-10-09 21:25 一丝清风一抹红尘 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 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 @ 2018-10-09 20:52 一丝清风一抹红尘 阅读(78) 评论(0) 推荐(0) 编辑
摘要: Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
posted @ 2018-10-09 20:43 一丝清风一抹红尘 阅读(177) 评论(0) 推荐(0) 编辑
摘要: We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter would c 阅读全文
posted @ 2018-10-09 19:44 一丝清风一抹红尘 阅读(250) 评论(0) 推荐(0) 编辑