Reply to thread

Message

<blockquote data-quote="rclakmal" data-source="post: 5976096" data-attributes="member: 98858">[code]/*&nbsp;* To change this template, choose Tools | Templates&nbsp;* and open the template in the editor.&nbsp;*/package example1;import java.util.ArrayList;import java.util.HashMap;import java.util.Random;import java.util.Scanner;import java.util.TreeSet;/**&nbsp;*&nbsp;* @author Lakmal&nbsp;*/class Permutations {&nbsp; &nbsp; public static void main(String str[]) {&nbsp; &nbsp; &nbsp; &nbsp; Scanner input = new Scanner(System.in);&nbsp; &nbsp; &nbsp; &nbsp; Random ran = new Random();&nbsp; &nbsp; &nbsp; &nbsp; String s = &quot;&quot;;&nbsp; &nbsp; &nbsp; &nbsp; ArrayList counted = new ArrayList();&nbsp; &nbsp; &nbsp; &nbsp; TreeSet ts = new TreeSet();&nbsp; &nbsp; &nbsp; &nbsp; ArrayList al = new ArrayList();&nbsp; &nbsp; &nbsp; &nbsp; HashMap hm = new HashMap();&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Number of input digits&quot;);&nbsp; &nbsp; &nbsp; &nbsp; int n = input.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; int numbers[] = new int[n];&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter your numbers:&quot;);&nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; n; i++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numbers[i] = input.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int count = 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int j = 0; j &lt; al.size(); j++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (numbers[i] == (Integer) al.get(j)) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; count++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; hm.put(numbers[i], count);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; al.add(numbers[i]);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; numbers.length; i++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; boolean isCounted = false;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int k = 0; k &lt; counted.size(); k++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (numbers[i] == (Integer) counted.get(k)) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; isCounted = true;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (((Integer) hm.get(numbers[i]) != 1) &amp;&amp; (isCounted == false)) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n = n - (Integer) hm.get(numbers[i]) + 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; counted.add(numbers[i]);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter number of Places&quot;);&nbsp; &nbsp; &nbsp; &nbsp; int noOfPlaces = input.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; do {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; s = &quot;&quot;;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int k = 1; k &lt;= noOfPlaces; k++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; s += &quot;&quot; + numbers[ran.nextInt(n)];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ts.add(s);&nbsp; &nbsp; &nbsp; &nbsp; } while (ts.size() &lt; (int) Math.pow(n, noOfPlaces));&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Number Of Permutations=&quot; + ts.size());&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Permutations&quot;);&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(ts);&nbsp; &nbsp; }}[/code]Hey here is my answer !!! If u have the JVM please run it and see !!!!I dont think this is the perfect solution ! Because it will get slow when number of inputs are increased.Example if u have 3 digits [0,1,2]and no of places are 3 it will be really fast !!! But when no of places and no of digits get increased (about 6 ,7) it will get slower about 30-45 seconds Will try a good algorithem than this ,but dont have much time now !!! And specially if u r developing plz remember when there are digits list like [1 0 0]( a number is repeated) then u have to consider about that also !! Good problem ,,,,, thanks for it !!!!!!</blockquote>

[QUOTE="rclakmal, post: 5976096, member: 98858"] [code] /* * To change this template, choose Tools | Templates * and open the template in the editor. */ package example1; import java.util.ArrayList; import java.util.HashMap; import java.util.Random; import java.util.Scanner; import java.util.TreeSet; /** * * @author Lakmal */ class Permutations { public static void main(String str[]) { Scanner input = new Scanner(System.in); Random ran = new Random(); String s = ""; ArrayList counted = new ArrayList(); TreeSet ts = new TreeSet(); ArrayList al = new ArrayList(); HashMap hm = new HashMap(); System.out.println("Number of input digits"); int n = input.nextInt(); int numbers[] = new int[n]; System.out.println("Enter your numbers:"); for (int i = 0; i < n; i++) { numbers[i] = input.nextInt(); int count = 1; for (int j = 0; j < al.size(); j++) { if (numbers[i] == (Integer) al.get(j)) { count++; } } hm.put(numbers[i], count); al.add(numbers[i]); } for (int i = 0; i < numbers.length; i++) { boolean isCounted = false; for (int k = 0; k < counted.size(); k++) { if (numbers[i] == (Integer) counted.get(k)) { isCounted = true; } } if (((Integer) hm.get(numbers[i]) != 1) && (isCounted == false)) { n = n - (Integer) hm.get(numbers[i]) + 1; } counted.add(numbers[i]); } System.out.println("Enter number of Places"); int noOfPlaces = input.nextInt(); do { s = ""; for (int k = 1; k <= noOfPlaces; k++) { s += "" + numbers[ran.nextInt(n)]; } ts.add(s); } while (ts.size() < (int) Math.pow(n, noOfPlaces)); System.out.println("Number Of Permutations=" + ts.size()); System.out.println("Permutations"); System.out.println(ts); } } [/code] Hey here is my answer !!! If u have the JVM please run it and see !!!! I dont think this is the perfect solution ! Because it will get slow when number of inputs are increased. Example if u have 3 digits [0,1,2] and no of places are 3 it will be really fast !!! But when no of places and no of digits get increased (about 6 ,7) it will get slower about 30-45 seconds Will try a good algorithem than this ,but dont have much time now !!! And specially if u r developing plz remember when there are digits list like [1 0 0] ( a number is repeated) then u have to consider about that also !! Good problem ,,,,, thanks for it !!!!!! [/QUOTE]

Verification

Awruddata maasa keeyada?

Search

Latest ads

Reply to thread