Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
4th ques
//'main' method must be in a class 'Rextester'. //openjdk version '11.0.5' import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { Scanner sc=new Scanner(System.in); String str=sc.nextLine(); int i,j=0; int n=0; String words[]=str.split(" "); for(String s:words) n++; String N="N"; int b[]=new int[n]; int tmp; //System.out.println(n); for(String s:words) { //System.out.println(s); if(s.equals(N)) b[j++]=0; else { tmp=Integer.parseInt(String.valueOf(s));; b[j++]=tmp; } } for(i=0;i<n;i++) System.out.print(b[i]+" "); LinkedList<Integer> a[]=new LinkedList[n]; for(i=0;i<n;i++) a[i]=new LinkedList<>(); j=-1; for(i=0;i<((n)/2 + 1);i++) // yaha mistake hai ...... i ko aage tak kaise le jaaye { if(b[i]==0) { // j++; continue; } if(b[i]!=0) j++; if(b[2*j+1]!=0) { a[b[i]].addFirst(b[2*j+1]); a[b[2*j+1]].addFirst(b[i]); } if(b[2*j+2]!=0) { a[b[i]].addFirst(b[2*j+2]); a[b[2*j+2]].addFirst(b[i]); } } System.out.println(); for ( i = 1; i <n ; i++) { if(a[i].size()>0) { System.out.print("Vertex " + i + " is connected to: "); for (j = 0; j < a[i].size(); j++) { System.out.print(a[i].get(j) + " "); } System.out.println(); } } } }
run
|
edit
|
history
|
help
0
Find a dot in a string
Binary Tree Max path Sum
4.A
Palindrome String Checking
Factorial using recursion in java
test
Opr
Lexisort
1.5
Extracting Value from a String that contains key value pairs