Data-Structure-programs/merging.java at main · Muqsit-hussain6/Data-Structure-programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
class LinkedList
{
	Node head;
	int arr[];
	static class Node
	{
		Node next;
		int data;
		Node(int data)
	{
		this.next=null;
		this.data=data;
	}
	}


	void InsertEnd(int data)
	{
		Node n=new Node(data);
		if(head==null)
		{
		head=n;
		}
		else
		{
			Node cur=head;
			while(cur.next!=null)
				cur=cur.next;

			cur.next=n;
		}
	}

	public void mergee()
{
	int size=0;int p=0;int sum=0;
	Node cur=head;
	while(cur.next!=null)
	{
		if(cur.data==0)
			size++;
		cur=cur.next;
	}
	arr=new int[size];
	Node temp=head.next;

	while(temp!=null)
	{
	if(temp.data!=0)
	{
	sum=sum+temp.data;
	}
	else
	{
	arr[p]=sum;
	p++;
	sum=0;
	}

	temp=temp.next;
	}

	for(int i=0;i<size;i++)
	{
		System.out.println(arr[i]);
	}


}

	public void merge()
	{
	int sum=0;int p=0;int size=0;

	Node cur=head;
	while(cur.next!=null)
	{
		if(cur.data==0)
			size++;
			cur=cur.next;
	}
	System.out.println(size);
	int[] a=new int[size];

	cur=head.next;
	while(cur!=null)
	{
		if(cur.data==0)
		{
			a[p++]=sum;
			cur=cur.next;
			sum=0;
		}
		else
		{
			sum=sum+cur.data;
			cur=cur.next;
		}

	}

	for(int i=0;i<size;i++)
	{
		System.out.println(a[i]+"  ");
	}


}


}

	class merging
	{
	public static void main(String[] args)
	{
	LinkedList g=new LinkedList();
	g.InsertEnd(0);
	g.InsertEnd(3);
	g.InsertEnd(1);
	g.InsertEnd(0);
	g.InsertEnd(4);
	g.InsertEnd(5);
	g.InsertEnd(0);

	//g.merge();
	g.mergee();
	}
	}