Leeyoung(●'◡'●)

144. 二叉树的前序遍历 Given a binary tree, return the preorder traversal of its nodes’ values. 给定一棵二叉树，返回其节点值的前序遍历。 For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,...

1. 两数之和 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 solu...

94. 中序遍历二叉树Given a binary tree, return the inorder traversal of its nodes’ values. 给定一个二叉树，返回其中序遍历。 For example: Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recur

Given a binary tree, return the postorder traversal of its nodes’ values. 给定一棵二叉树，返回其节点值的后序遍历。 For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [3,2,1]. Note: R...

102. 二叉树的层次遍历 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). 给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问）。 For example: Given binary t...

414. 第三大的数 Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). 给定一个非空数组，返回此数组中第三...

0.交换元素方法 private void Swap(ref int a, ref int b) { var temp = a; a = b; b = temp; } 1.冒泡排序 public int[] BubbleSort(int[] originInts) ...

Sort a linked list in O(n log n) time using constant space complexity. /** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * ...

53. 最大子序和 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. 给定一个序列（至少含有 1 个数），从该序列中寻找一个连续的子序列，使得子序列的和最大。 For example, given the array [-2,1,-3...