Skip to content

CountFriendsPairing Algorithm Added #2889

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 6 commits into from
Closed

CountFriendsPairing Algorithm Added #2889

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
3c9dd3f
CountFriendsPairing algorithm added with test ccccases
Deeeeksha Jan 2, 2022
edbdb00
CountFriendsPairing algorithm added with test ccccases
Deeeeksha Jan 2, 2022
32ca6a7
Update CountFriendsPairingTest.java
Deeeeksha Jan 2, 2022
8ca543f
Delete src/test/java/com/thealgorithms/dynamicprogramming directory
Deeeeksha Jan 2, 2022
7ef489b
Golomb Sequence algorithm added
Deeeeksha Jan 2, 2022
d9e7a2f
Merge branch 'master' of https://github.com/Deeeeksha/Java
Deeeeksha Jan 2, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Golomb Sequence algorithm added
  • Loading branch information
@Deeeeksha
Deeeeksha committed Jan 2, 2022
commit 7ef489b1beddf009fdeceebce52545b5961557ac
24 changes: 24 additions & 0 deletions src/main/java/com/thealgorithms/dynamicprogramming/GolombSequence.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
import java.util.*;

class GolombSequence
{
public static void printGolomb(int n)
{
int dp[] = new int[n + 1];

dp[1] = 1;
System.out.print(dp[1] + " ");

for (int i = 2; i <= n; i++)
{
dp[i] = 1 + dp[i - dp[dp[i - 1]]];

System.out.print(dp[i] + " ");
}
}
public static void main (String[] args)
{
int n = 9;
printGolomb(n);
}
}