线段树&315 LeetCode:Count of Smaller Numbers After Self

转载 2016年08月30日 04:58:47

一:线段树的基本概念

线段树是一颗二叉搜索树,与区间树相似,讲一个区间划分成一些单元区间,每一个单元区间对应线段树中一个叶子节点
线段树上的每一个非叶子节点[a,b],它的左儿子表示区间为[a,(a+b)/2], 右儿子表示的区间为[(a+b)/2+1,b]。因此线段树是平衡二叉树,最后的子节点的数目为N。即是整个线段区间的长度。

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].

Example:

Given nums = [5, 2, 6, 1]

To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.
Return the array [2, 1, 1, 0].

解法:每一个节点保存2个value
一个是sum:用来记录在树当前节点左下方的节点个数
一个是dup:用来记录数组中的重复元素
for example [3,2,2,6,1]
When we try to insert a number, the total number of smaller number would be adding dup and sum of the nodes where we turn right.
for example, if we insert 5, it should be inserted on the way down to the right of 3, the nodes where we turn right is 1(0,1), 2,(0,2), 3(0,1), so the answer should be (0 + 1)+(0 + 2)+ (0 + 1) = 4

if we insert 7, the right-turning nodes are 1(0,1), 6(3,1), so answer should be (0 + 1) + (3 + 1) = 5

1(0, 1)
\
6(3, 1)
/
2(0, 2)
\
3(0, 1)

class Node{
           Node left,right;
           int val,sum,dup = 1;
           public Node(int v,int s){
           val = v
           sum = s}
}
public class Solution {
    class Node {
        Node left, right;
        int val, sum, dup = 1;
        public Node(int v, int s) {
            val = v;
            sum = s;
        }
    }
    public List<Integer> countSmaller(int[] nums) {
        Integer[] ans = new Integer[nums.length];
        Node root = null;
        for (int i = nums.length - 1; i >= 0; i--) {
            root = insert(nums[i], root, ans, i, 0);
        }
        return Arrays.asList(ans);
    }
    private Node insert(int num, Node node, Integer[] ans, int i, int preSum) {
        if (node == null) {
            node = new Node(num, 0);
            ans[i] = preSum;
        } else if (node.val == num) {
            node.dup++;
            ans[i] = preSum + node.sum;
        } else if (node.val > num) {
            node.sum++;
            node.left = insert(num, node.left, ans, i, preSum);
        } else {
            node.right = insert(num, node.right, ans, i, preSum + node.dup + node.sum);
        }
        return node;
    }
}

LeetCode 315. Count of Smaller Numbers After Self (逆序数对)

原题网址:https://leetcode.com/problems/count-of-smaller-numbers-after-self/ You are given an integer a...
  • jmspan
  • jmspan
  • 2016年04月22日 13:21
  • 1792

[leetcode] 315. Count of Smaller Numbers After Self 解题报告

题目链接: https://leetcode.com/problems/count-of-smaller-numbers-after-self/ You are given an integer ...
  • qq508618087
  • qq508618087
  • 2016年05月05日 10:43
  • 2939

leetcode -- Count of Smaller Numbers After Self -- 经典求逆序数

https://leetcode.com/problems/count-of-smaller-numbers-after-self/思路1 merge sort关于merge sort归并排序的时候,...
  • xyqzki
  • xyqzki
  • 2015年12月25日 19:46
  • 6533

【Leetcode】Count of Smaller Numbers After Self

题目链接:https://leetcode.com/problems/count-of-smaller-numbers-after-self/ 题目: You are given an i...
  • yeqiuzs
  • yeqiuzs
  • 2016年05月29日 21:45
  • 3648

leetcode :315. Count of Smaller Numbers After Self :归并排序应用

315. Count of Smaller Numbers After Self My Submissions Question Editorial Solution Total Accepte...
  • smileyk
  • smileyk
  • 2016年03月29日 21:11
  • 766

LeetCode—315 Count of Smaller Numbers After Self

好久没做出题目来了。 思路:好蠢的一题!从右往左进行二分插入排序,把插入的位置记录下来即可。。。好蠢! public class Solution { public List countSma...
  • corpsepiges
  • corpsepiges
  • 2015年12月07日 15:33
  • 615

LeetCode #315 Count of Smaller Numbers After Self

LeetCode #315 Count of Smaller Numbers After Self问题描述 给出一个整数序列,求解在这个序列中每个数字右边有多少个数字比当前数字小。 例子: G...
  • zhihui_megumi
  • zhihui_megumi
  • 2016年10月18日 17:11
  • 139

315、Count of Smaller Numbers After Self(Hard)

You are given an integer array nums and you have to return a new counts array. The counts array has ...
  • wengeyiming
  • wengeyiming
  • 2016年08月20日 21:44
  • 126

【算法】逆序对问题的四种解法(归并排序,BST,树状数组,线段树)及变形

引发我对逆序对这个问题思考的源自这道题:315. Count of Smaller Numbers After Self 以前我以为求一个序列逆序对个数的解法就是归并排序的改版...
  • haolexiao
  • haolexiao
  • 2017年02月12日 17:18
  • 1187

315. 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...
  • kakitgogogo
  • kakitgogogo
  • 2016年05月05日 22:06
  • 800
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:线段树&315 LeetCode:Count of Smaller Numbers After Self
举报原因:
原因补充:

(最多只允许输入30个字)