yesr的博客

【思路分析】 二叉树中序遍历的实现通常有两种方法：递归和迭代。 递归思路很简单，所以这里我只说迭代版本的思路。 根据中序遍历的顺序，对于任一结点，优先访问其左孩子，而左孩子结点又可以看做一根结点，然后继续访问其左孩子结点，直到遇到左孩子结点为空的结点才进行访问，然后按照相同的规则访问其 右子树。因此处理过程如下： 对任一结点p1.若其左孩子不为空，则将p入栈并将p的左孩子置为当前的p，然后...

Product of Array Except Self 【题目】 Given an arraynumsofnintegers wheren> 1, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i]. Ex...

Remove Duplicates from Sorted Array 【题目】 Given a sorted arraynums, remove the duplicatesin-placesuch that each element appear onlyonceand return the new length. Do not allocate extra space for...

Three Sum 【题目】 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. （给定一个包含 n 个整数的数组 num...

Two Sum II - Input array is sorted 【题目】 Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum...

Two Sum 【题目】 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may no...

Search Insert Position 【题目】 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume...

Reverse Integer 【题目】 Given a 32-bit signed integer, reverse digits of an integer. （翻译：给定一个 32 位有符号整数，将整数中的数字进行反转。） Example: Input: 123 Output: 321 Input: -123 Output: -321 Input: 120 Output: 2...

Rotate Array 【题目】 Given an array, rotate the array to the right by k steps, where k is non-negative. （翻译：给定一个数组，将数组中的元素向右移动 k 个位置，其中 k 是非负数。） Example 1: Input: [1,2,3,4,5,6,7] and k = 3 Output: ...

Longest Substring Without Repeating Characters 【题目】 Given a string, find the length of the longest substring without repeating characters. （给定一个字符串，找字符中的最大非重复子串） Example 1: Input: "abcabcbb" Out...

Best Time to Buy and Sell Stock 【题目】 Say you have an array for which the i th element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., b...

Pascal's Triangle II 【题目】 Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. （翻译：给定一个非负索引 k，其中 k ≤ 33，返回杨辉三角的第 k 行...

Pascal's Triangle 【题目】 Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. （翻译：给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。） In Pascal's triangle, each number is the s...

Maximum Subarray 【题目】 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5...