第四章 LeetCode 题解 0001~0099 0001. Two Sum 0002. Add Two Numbers 0003. Longest Substring Without Repeating Characters 0004. Median of Two Sorted Arrays 0005. Longest Palindromic Substring 0006. Zig Zag Conversion 0007. Reverse Integer 0008. String to Integer Atoi 0009. Palindrome Number 0011...
1 class Solution { 2 public List<Integer> countSmaller(int[] nums) { 3 LinkedList<Integer> res = new LinkedList<>(); 4 if(nums == null || nums.length == 0){ 5 return res; 6 } 7 8 int offset = 10000; 9 int [] tree = new int[2 * offset + 2]; 10 11 for(int i = ...
LeetCode 2006. Count Number of Pairs With Absolute Difference K LeetCode 2006. Count Number of Pairs With Absolute Difference K (差的绝对值为 K 的数对数目) 题目 链接 https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k/ 问题描述 给你一个整数数组 nums 和一个整...
0024-Swap-Nodes-in-Pairs 0025-Reverse-Nodes-in-k-Group 0026-Remove-Duplicates-from-Sorted-Array 0027-Remove-Element 0028-Implement-strStr 0033-Search-in-Rotated-Sorted-Array 0034-Search-for-a-Range 0036-Valid-Sudoku 0037-Sudoku-Solver 0038-Count-and-Say/cpp-0038 CMakeLists.tx...
clean codeMap<String, Integer>wordMap=newHashMap<>();// Using try-with-resource statement for automatic resource managementtry(FileInputStreamfis=newFileInputStream(fileName);DataInputStreamdis=newDataInputStream(fis);BufferedReaderbr=newBufferedReader(newInputStreamReader(dis))) {// words are ...
第四章 LeetCode 题解 0001~0099 0001. Two Sum 0002. Add Two Numbers 0003. Longest Substring Without Repeating Characters 0004. Median of Two Sorted Arrays 0005. Longest Palindromic Substring 0006. Zig Zag Conversion 0007. Reverse Integer 0008. String to Integer Atoi 0009. Palindrome Number 0011...
https://github.com/grandyang/leetcode/issues/315 类似题目: Count of Range Sum Queue Reconstruction by Height Reverse Pairs 参考资料: https://leetcode.com/problems/count-of-smaller-numbers-after-self/ https://leetcode.com/problems/count-of-smaller-numbers-after-self/discuss/76576/My-simple-AC-...
}privatevoidmergeSort(Pair[] pairs, Pair[] aux,intleft,intright) {if(left <right) {intmid = left + (right - left) / 2; mergeSort(pairs, aux, left, mid); mergeSort(pairs, aux, mid+ 1, right);for(inti = left; i <= right; i++) { ...
第四章 LeetCode 题解 0001~0099 0001. Two Sum 0002. Add Two Numbers 0003. Longest Substring Without Repeating Characters 0004. Median of Two Sorted Arrays 0005. Longest Palindromic Substring 0006. Zig Zag Conversion 0007. Reverse Integer 0008. String to Integer Atoi 0009. Palindrome Number 0011...
这题 和 327. Count of Range Sum and 493. Reverse Pairs 几乎一样的解法,都属于hard 题, 可以用 merge sort, segment tree 和 BST 去求解。 注意如果自己去实现简单的BST, 在数组已经排序好的情况下 比 [1 2 3 4 5 6 ],会造成BST 退化成一个数组,从而造成TLE, 可以去用TreeSet 去做,TreeSet 用...