This is a java program to generate and print all the partitions of a number such that when those partition elements are added results in the number itself, plus the partition should be unique. We start with the number, number minus one is the next partition and so on, till all one’s are the last partition where we stop.
Here is the source code of the Java Program to Perform integer Partition for a Specific Case. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to perform integer partition such that every partition is unique import java.util.Scanner; public class Integer_Partition { public static void print(int[]p, int n) { for(int i=0; i<n; i++) System.out.print(p[i]+" "); System.out.println(); } public static void generateUniquePartition(int n) { int []p = new int[n]; int k = 0; p[k] = n; while(true) { print(p, k+1); int rem_value = 0; while(k >= 0 && p[k] == 1) { rem_value += p[k]; k--; } if(k < 0) return; p[k]--; rem_value++; while(rem_value > p[k]) { p[k+1] = p[k]; rem_value -= p[k]; k++; } p[k+1] = rem_value; k++; } } public static void main(String args[]) { System.out.println("Partitioning of a given Integer such that every partition is unique"); System.out.println("Enter the number:"); Scanner sc = new Scanner(System.in); int n = sc.nextInt(); generateUniquePartition(n); sc.close(); } }
Output:
$ javac Integer_Partition.java $ java Integer_Partition Partitioning of a given Integer such that every partition is unique Enter the number: 6 6 5 1 4 2 4 1 1 3 3 3 2 1 3 1 1 1 2 2 2 2 2 1 1 2 1 1 1 1 1 1 1 1 1 1
Related posts:
Test a REST API with Java
Java Program to Implement Gift Wrapping Algorithm in Two Dimensions
Java Program to Implement the MD5 Algorithm
HttpClient Connection Management
Java Program to Implement Knapsack Algorithm
Converting Iterator to List
HTTP Authentification and CGI/Servlet
Encode/Decode to/from Base64
Toán tử trong java
Error Handling for REST with Spring
Java Byte Array to InputStream
Weak References in Java
Java Program to Perform Inorder Non-Recursive Traversal of a Given Binary Tree
Java Program to Describe the Representation of Graph using Adjacency Matrix
Java Program to Compute Discrete Fourier Transform Using Naive Approach
ArrayList trong java
Các kiểu dữ liệu trong java
Java Program to Implement Hash Trie
Java Program to Implement Shell Sort
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Implement Lloyd’s Algorithm
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Java String to InputStream
Spring Data MongoDB Transactions
Custom JUnit 4 Test Runners
Java Program to Check whether Undirected Graph is Connected using DFS
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Java Program to Implement Gauss Seidel Method
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Java Program to Implement Adjacency List
Spring Data JPA and Null Parameters
Java Program to Implement Queue