CrazyAoli-CSDN博客

原创 [Tree]Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

这道题是通过preorder和inorder的顺序来确认整个tree。思路：preorder: root, left, right; inorder: left, root, right。example: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7];preorder第一个一定是root，记录下root的值，在inorder里面找到root对应的index，那么root的左边就是左子树，root的右边就是右子树。recurively找到r

2022-01-30 10:28:37 417

原创 Twitter 下载遇到的问题

1.Error: jupyterlab-server 1.0.0 has requirement jsonschema>=3.0.1, but you'll have jsonschema 2.6.0 which is incompatible.解决方法：在终端输入conda install -c anaconda jsonschemaReference:https://stackoverflow.com/questions/55682050/jsonschema-2-6-0-is-.

2021-03-18 09:26:50 3123

原创 [MergeSort]LintCode463. Sort Integers

public class Solution { public void sortIntegers(int[] A) { if (A == null || A.length == 0) { return; } int[] temp = new int[A.length]; mergeSort(A, 0, A.length - 1, temp); } private void mergeSo

2021-02-11 12:11:11 165

原创 [QuickSort]LintCode463. Sort Integers

463. Sort IntegersGiven an integer array, sort it in ascending order. Use selection sort, bubble sort, insertion sort or any O(n2) algorithm.样例Example 1:Input: [3, 2, 1, 4, 5]Output: [1, 2, 3, 4, 5]Explanation: return the sorted array.Example 2:

2021-02-08 09:25:22 90

原创 [TwoPointers][2]Lintcode587. Two Sum - Unique pairs

Amazon | OA 2019 | Two Sum - Unique PairsGiven an int array nums and an int target, find how many unique pairs in the array such that their sum is equal to target. Return the number of pairs.Example 1:Input: nums = [1, 1, 2, 45, 46, 46], target = 47Out

2021-02-01 03:27:37 192

原创 [Two Pointers][1]Leetcode170. Two Sum III - Data structure design

Leetcode170. Two Sum III - Data structure designSolution1: HashMapclass TwoSum { private HashMap<Integer, Integer> map; /** Initialize your data structure here. */ public TwoSum() { map = new HashMap<>(); }

2021-01-31 23:48:07 101

原创 [String][6]Lintcode1790. Rotate String II

Lintcode 1790. Rotate String II描述Given a string(Given in the way of char array), a right offset and a left offset, move the string according to the given offset and save it in a new result set. (left offest represents the offset of a string to the left,r

2021-01-31 09:03:00 90

原创 [String][3]Leetcode125. Valid Palindrome

125. Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.Note: For the purpose of this problem, we define empty string as valid palindrome.Example 1:Input: "A man, a plan, a canal

2021-01-30 23:52:06 86

原创 [String][2]Leetcode28. Implement strStr()

Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Clarification:What should we return when needle is an empty string? This is a great question to ask during an interview.For the p

2021-01-30 11:16:24 61

chenxinjk2的专栏

原创 [Tree]Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

原创 Twitter 下载遇到的问题

原创 [MergeSort]LintCode463. Sort Integers

原创 [QuickSort]LintCode463. Sort Integers

原创 [TwoPointers][2]Lintcode587. Two Sum - Unique pairs

原创 [Two Pointers][1]Leetcode170. Two Sum III - Data structure design

原创 [String][6]Lintcode1790. Rotate String II

原创 [String][3]Leetcode125. Valid Palindrome

原创 [String][2]Leetcode28. Implement strStr()

原创 BinarySearch[5]34. Find First and Last Position of Element in Sorted Array

原创 BinarySearch[4]153. Find Minimum in Rotated Sorted Array

原创 BinarySearch[3]Leetcode852. Peak Index in a Mountain Array

原创 Mac解决sublime Text3 package control出现There are no packages available for installation

原创 Mac 安装sublime Text3里面的package control 各种错误示范

空空如也

空空如也