Maximum value's random index

#include <vector>
#include <iostream>
#include <cstdlib>
#include <climits>
#include <time.h>
using namespace std;

// naive method
// Go through the array once, find the max and the number of occurrences (n)
// Generate a random number (r) between 1 and n
// Go through the array again, return rth occurrance.
int randomIndex(vector<int>& nums) {
  int max_val = INT_MIN;
  int count = 0;
  for(int i = 0; i < nums.size(); ++i) {
    if(nums[i] > max_val) {
      max_val = nums[i];
      count = 1;
    } else if(nums[i] == max_val) {
      count++;
    }
  }
  srand(time(NULL));
  int random_value = rand() % count + 1;
  cout << random_value << endl;
  cout << "random value is" << endl;
  int max_index = 1;
  for(int i = 0; i < nums.size(); ++i) {
    if(nums[i] == max_val && max_index == random_value) {
      return i;
    } else if(nums[i] == max_val) max_index++;
  }
}

int main(void) {
  vector<int> nums{2, 1, 2, 1, 5, 4, 5, 5};
  cout << randomIndex(nums) << endl;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值