小榕流光的专栏

题目链接: https://leetcode.com/problems/count-of-range-sum/Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the s

题目链接：https://leetcode.com/problems/sort-list/Sort a linked list in O(n log n) time using constant space complexity.思路：用快速排序的话一个比较难的问题是不能随机访问链表，而归并排序可以利用递归的性质。归并排序时间复杂度为O(n*log(n))，但是这题要求

题目链接: https://leetcode.com/problems/count-of-smaller-numbers-after-self/You are given an integer array nums and you have to return a new counts array. The counts array has the property where cou