- 博客(3)
- 收藏
- 关注
RSS订阅原创 [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
173
原创 [QuickSort]LintCode463. Sort Integers
463. Sort Integers Given 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
99
原创 [TwoPointers][2]Lintcode587. Two Sum - Unique pairs
Amazon | OA 2019 | Two Sum - Unique Pairs Given 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 = 47 Out
2021-02-01 03:27:37
200
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人