Leetcode
Fantastic_HQ
厚积才能薄发。
展开
-
Leetcode-94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2] /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; *原创 2020-08-28 16:54:16 · 82 阅读 · 0 评论 -
Leetcode-15. 3Sum
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. Example: Given array nums = [-1, 0原创 2020-07-23 16:02:13 · 121 阅读 · 0 评论 -
Leetcode-70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Note: Given n will be a positive integer. Example 1: Input: 2 Output: 2 Explanation: There原创 2020-06-21 16:09:05 · 125 阅读 · 0 评论 -
Leetcode-11. Container With Most Water
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a containe原创 2020-06-20 10:08:52 · 138 阅读 · 0 评论 -
Leetcode-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. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] Note: You must do this in-place without making a copy of the array. Mini原创 2020-06-18 14:20:12 · 134 阅读 · 0 评论