HackerRank: Non-Divisible Subset

最新推荐文章于 2024-10-07 14:07:13 发布

turbozzz

最新推荐文章于 2024-10-07 14:07:13 发布

阅读量329

点赞数

分类专栏： hackerrank 文章标签： c++ 算法

本文链接：https://blog.csdn.net/victory_castle/article/details/105471472

版权

hackerrank 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

该博客主要讨论了在HackerRank上的一个算法挑战——如何找到一个非可除子集。关键点在于处理remainder数组，特别是当k为偶数时，remainder[k/2]应设为1，并且从remainder[0]中最多只能选择一个元素。博主深入探讨了如何应用这些考虑事项来解决问题。

摘要由CSDN通过智能技术生成

考虑事项：

remainder[k/2] = 1
remainder[0] 里面只能抽出一个
即 remainder[0] = std::min(remainder[0], 1)
and remainder[k/2] = std::min(remainder[k/2], 1) when k%2 == 0.

计算

for (int i = 0; i<=k/2, i++)
	maxRes += std::max(remainder[i], remainder[k-i]);

static int subsetPairNotDivisibleByK(int arr[], int n, int k) {
    int maximumSubset = 0;
    //creating an array with all possible remainder fo k
    int[] remainders = new int[k];

    //fill the array initially with 0
    Arrays.fill(remainders, 0);

    //loop through the array arr and get the frequency of the remainders
    for(int val: arr){
        int rem = val%k;
        remainders[rem]++;
    }
    //consider a case when k is even. eg. k=6 then remainder 3+3 is 6 so can not be cnsidered.
    if(k%2==0){
        remainders[k/2] = Math.min(remainders[k/2], 1);
    }
    //consider a case where we take number that is divisible by k into consideration,
    //there is only 1 number can be considered e.g. k=3 then we can either consider 3 or 9 both can not be considered together.
    maximumSubset = Math.min(remainders[0], 1);

    //loop through the array of remainders array and get the max of remainder[i] or remainder[i-k]
    for(int i=1;i<=k/2;i++){
        maximumSubset+=Math.max(remainders[i], remainders[k-i]);
    }

    return maximumSubset;

}