LintCode_248 Count of Smaller Number

Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you an integer, return the number of element in the array that are smaller than the given integer.

 Notice

We suggest you finish problem Segment Tree Build and Segment Tree Query II first.

Example

For array [1,2,7,8,5], and queries [1,8,5], return [0,4,2]

Challenge 

Could you use three ways to do it.

  1. Just loop
  2. Sort and binary search
  3. Build Segment Tree and Search.
    class Solution {
    public:
       /**
         * @param A: An integer array
         * @return: The number of element in the array that 
         *          are smaller that the given integer
         */
        vector<int> countOfSmallerNumber(vector<int> &A, vector<int> &queries) {
            // write your code here
            sort(A.begin(), A.end());
            vector<int> res;
            for (int i = 0; i < queries.size(); i++) {
                auto itr = lower_bound(A.begin(), A.end(), queries[i]);
                int count = itr - A.begin();
                res.push_back(count);
            }
            return res;
        }
    };


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值