THEONE10211024的专栏

leetCode是目前一个针对面试算法比较好的oj平台，上面有常见的、新鲜的面试算法题目。在刷了一部分题目之后，我觉得针对一道题目，AC不是最后的目的。一道好的题目，不是一次AC就能说明你已经解决这道问题。代码的效率、整洁性、其他解决思路或者一些别人用到的而你不知道的小技巧都应该是在AC后值得慢慢研读、学习和做笔记的。因此，我觉得有必要将之前做过的题目整理下来，相信会有不少的收获！在此之前，我

Two Sum Given an arrayof integers, find two numbers such that they add up to a specific targetnumber.The functiontwoSum should return indices of the two numbers such that they add up to thetarge

题目描述：Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3],

题目描述：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.分析：题目让求的是从根节点到叶子节点的最"矮"树高度，可采用递归。递归计算

题目描述：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.Example 1:Input: 5 / \ 3 6 / \ \

题目描述：Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case

题目描述：Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected elemen

题目描述：Given the coordinates of four points in 2D space, return whether the four points could construct a square.The coordinate (x,y) of a point is represented by an integer array with two integers.Exam

Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node. If there is no