标签:target nums int back Solution 随机数 push 398 Leetcode
Given an integer array nums
with possible duplicates, randomly output the index of a given target
number. You can assume that the given target number must exist in the array.
Implement the Solution class:
Solution(int[] nums)
Initializes the object with the arraynums
.int pick(int target)
Picks a random indexi
fromnums
wherenums[i] == target
. If there are multiple valid i's, then each index should have an equal probability of returning.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/random-pick-index
实现方法比较垃圾,差不多是离散化之后记录下每个数字出现的位置,然后记录有几个位置,然后循环输出(竟然真的会检测概率相等)。
class Solution {
public:
map<int, int> m;
vector<int> t, now;
vector<vector<int>> g;
Solution(vector<int>& nums) {
vector<int> cop = nums;
std::sort(nums.begin(), nums.end());
int N = nums.size(), cnt = 0;
m.insert(make_pair(nums[0], cnt++));
nums[0] = m[nums[0]], g.push_back(vector<int>()), t.push_back(0), now.push_back(0);
for (int i = 1; i < N; i++) {
if (nums[i] != nums[i-1]) m.insert(make_pair(nums[i], cnt++)), g.push_back(vector<int>()), t.push_back(0), now.push_back(0);
nums[i] = m[nums[i]];
}
for (int i = 0; i < N; i++) {
g[m[cop[i]]].push_back(i);
t[m[cop[i]]]++;
}
}
int pick(int target) {
if (m.find(target) == m.end()) return -1;
else {
int tem = m[target];
now[tem] = (now[tem] + 1) % t[tem];
return g[tem][now[tem]];
}
}
};
/**
* Your Solution object will be instantiated and called as such:
* Solution* obj = new Solution(nums);
* int param_1 = obj->pick(target);
*/
标签:target,nums,int,back,Solution,随机数,push,398,Leetcode 来源: https://www.cnblogs.com/Gensokyo-Alice/p/16192678.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。