z_zhaojun的博客

转载请注明出处：z_zhaojun的博客 原文地址：http://blog.youkuaiyun.com/u012975705/题目地址：https://leetcode.com/problems/pascals-triangle-ii/Pascal’s Triangle IIGiven an index k, return the kth row of the Pascal's tri

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algo

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 Missing NumberGiven an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},return [1,2,3].思路：优先添

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 Best Time to Buy and Sell Stock IISay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum pro

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 Best Time to Buy and Sell Stock My Submissions QuestionSay you have an array for which the ith element is the price of a given stock on day i.If you were only permit

转载请注明出处：z_zhaojun的博客 原文地址 题目地址 Product of Array Except SelfGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of

转载请注明出处：z_zhaojun的博客 原文地址：http://blog.youkuaiyun.com/u012975705 题目地址：https://leetcode.com/problems/linked-list-cycle-ii/Linked List Cycle IIGiven a linked list, return the node where the cycle be

转载请注明出处：z_zhaojun的博客 原文地址：http://blog.youkuaiyun.com/u012975705 题目地址：https://leetcode.com/problems/reverse-linked-list-ii/Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all

转载请注明出处：z_zhaojun的博客 原文地址：http://blog.youkuaiyun.com/u012975705 题目地址：https://leetcode.com/problems/reverse-linked-list-ii/Reverse Linked List IIReverse a linked list from position m to n. Do it in-place an

转载请注明出处：z_zhaojun的博客 原文地址：http://blog.youkuaiyun.com/u012975705题目地址：https://leetcode.com/problems/move-zeroes/ Move ZeroesGiven an array nums, write a function to move all 0's to the end of it while

PS：文章最后附上完整代码一、中序遍历List<Integer> inOrder(BTree root) { List<Integer> result = new ArrayList<>(); Stack<BTree> stack = new Stack<&a