mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-08 02:04:31 +08:00

committed by
GitHub

parent
ab544c3b9f
commit
060069cf73
@ -0,0 +1,35 @@
|
||||
/** Author : Siddhant Swarup Mallick
|
||||
* Github : https://github.com/siddhant2002
|
||||
*/
|
||||
/**
|
||||
* In mathematics, the Golomb sequence is a non-decreasing integer sequence where n-th term is equal to number of times n appears in the sequence.
|
||||
*/
|
||||
|
||||
/**
|
||||
* Wikipedia Link - https://en.wikipedia.org/wiki/Golomb_sequence
|
||||
*/
|
||||
|
||||
/** Program description - To find the Golomb sequence upto n */
|
||||
|
||||
package com.thealgorithms.dynamicprogramming;
|
||||
|
||||
public class CountFriendsPairing {
|
||||
public static boolean countFriendsPairing(int n, int a[]) {
|
||||
int dp[] = new int[n + 1];
|
||||
// array of n+1 size is created
|
||||
dp[0] = 1;
|
||||
// since 1st index position value is fixed so it's marked as 1
|
||||
for (int i = 1; i < n; i++) {
|
||||
dp[i] = 1 + dp[i - dp[dp[i - 1]]];
|
||||
// formula for ith golomb sequence is dp(i) = 1 + dp(i – dp(dp(i - 1)))
|
||||
}
|
||||
for (int i = 1; i < n; i++) {
|
||||
if (a[i - 1] != dp[i]) {
|
||||
return false;
|
||||
// checks whether the calculated answer matches with the expected answer
|
||||
}
|
||||
}
|
||||
return true;
|
||||
// returns true if calculated answer matches with the expected answer
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user