LintCode-2/KnowledgeHash.md at master · pxu/LintCode-2 · GitHub

LintCode-2/KnowledgeHash.md at master · pxu/LintCode-2 · GitHub

• Arrays.asList([1,2,3]);
• Partial sort: Arrays.sort(arr, 0, arr.length())
• Copy: Arrays.copyOf(arr, arr.length())
• Arrays.toString(int[] arr) => string representation: "[1,2,3,4]"
• 见到数组要想到: 是否可以/需要先排序?

Honorable Problems

• Median of two sorted arrays: find kth element of two sorted array where k = n/2. Recursive findKth(A[],indexA, B[], indexB, k)

Read full article from LintCode-2/KnowledgeHash.md at master · pxu/LintCode-2 · GitHub