[Fork] [Fork] [Fork] tomet to continue2 | C# Online Compiler

[Fork] [Fork] [Fork] tomet to continue2 by dolevBA

using System;

namespace CS4
{
	public class MainClass
	{
		public static void Main(string[] args)
		{
			Test16();
		}

		public static void Test2016B4()
		{
			int[] arr = {1, 3, 3, 4, 4, 4, 7, 8, 9, 10};
			IntNode list = ArrayToIntList(arr);
			Console.WriteLine("List:");
			PrintIntNodeList(list);
			bool isTripple = (IsListTriple(list));
			arr = new int[]{1, 3, 3, 4, 1, 3, 3, 4, 1, 3, 3, 4};
			Console.WriteLine("Tripple = " + isTripple);
			list = ArrayToIntList(arr);
			Console.WriteLine("List:");
			PrintIntNodeList(list);
			isTripple = IsListTriple(list);
			Console.WriteLine("Tripple = " + isTripple);
		}

		public static void Test18()
		{
			int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
			Node<int> list1 = ArrayToList(arr);
			Console.WriteLine("List1:");
			PrintIntList(list1);
			int[] arr2 = {1, 2, 11};
			Node<int> list2 = ArrayToList(arr2);
			Console.WriteLine("List2:");
			PrintIntList(list2);
			Console.WriteLine("IsListContains: " + IsListContains(list1, list2));
			int[] arr3 = {4, 2, 5};
			Node<int> list3 = ArrayToList(arr3);
			Console.WriteLine("List3:");
			PrintIntList(list3);
			Console.WriteLine("IsListContains: " + IsListContains(list1, list3));
		}

		public static void Test17()
		{
			int[] arr = {1, 3, 3, 4, 4, 4, 7, 8, 9, 10};
			Node<int> list = ArrayToList(arr);
			Console.WriteLine("List:");
			PrintIntList(list);
			int longest = LongestSequence(list);
			Console.WriteLine("Longest = " + longest);
		}

		public static void Test16()
							  
		{
			Node<int> list1 = CreateSortedIntList(3);
			Console.WriteLine("List1:");
			PrintIntList(list1);
			Node<int> list2 = CreateSortedIntList(3);				//N			A
			Console.WriteLine("List2:");
			PrintIntList(list2);
			Node<int> merged = MergeLists(list1, list2);
			Console.WriteLine("Merged:");
			PrintIntList(merged);
		}

		public static void Test15()
		{
			int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
			Node<int> list = ArrayToList(arr);
			PrintIntList(list);
			Node<int> node = GetIt(list, 7);
			Console.WriteLine(node);
			node = GetIt(list, 11);
			Console.WriteLine(node);
		}

		public static void Test14()
		{
			char[] chars = {'K', 'K', 'K', 'B', 'B', 'K', 'Z', 'E', 'E', 'Z'};
			Node<char> first = new Node<char>(chars[0]);
			Node<char> pos = first;
			for (int i = 1; i < chars.Length; i++)
			{
				Node<char> node = new Node<char>(chars[i]);
				pos.SetNext(node);
				pos = node;
			}

			CompressSequences(first);
			PrintCharList(first);
		}

		public static void Test13()
		{
			CreateIntList(5);
		}

		public static void TestArrayToList()
		{
			int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
			Node<int> list = ArrayToList(arr);
			PrintIntList(list);
		}

		public static void Test12()
		{
			int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
			Node<int> list1 = ArrayToList(arr);
			Console.WriteLine("List1:");
			PrintIntList(list1);
			Console.WriteLine("Max = " + GetMax(list1));
		}

		public static void TestStringNode()
		{
			bool toContinue = true;
			Console.WriteLine("Enter word:");
			StringNode first = new StringNode(Console.ReadLine());
			StringNode last = first;
			while (toContinue)
			{
				Console.WriteLine("Enter word:");
				string str = Console.ReadLine();
				if (str == "")
				{
					toContinue = false;
				}
				else
				{
					StringNode word = new StringNode(str);
					last.SetNext(word);
					last = word;
				}
			}

			StringNode pos = first;
			while (pos != null)
			{
				Console.Write(pos);
				pos = pos.GetNext();
			}
		}

		public static void TestIntNode()
		{
			Random rnd = new Random();
			int n = rnd.Next(100);
			IntNode first = new IntNode(n);
			IntNode pos = first;
			/*
             * Create another node, by a new random value: second
             */
			IntNode second = new IntNode(n);
			pos = first;
			for (int i = 0; i < 5; i++)
			{
				n = rnd.Next(100);
				pos.SetNext(new IntNode(n));
				pos = pos.GetNext();
			}
		}

		public static IntNode ArrayToIntList(int[] arr)
		{
			IntNode first = new IntNode(arr[0]);
			IntNode pos = first;
			for (int i = 1; i < arr.Length; i++)
			{
				IntNode node = new IntNode(arr[i]);
				pos.SetNext(node);
				pos = node;
			}

			return first;
		}

		public static Node<int> ArrayToList(int[] arr)
		{
			Node<int> first = new Node<int>(arr[0]);
			Node<int> pos = first;
			for (int i = 1; i < arr.Length; i++)
			{
				Node<int> node = new Node<int>(arr[i]);
				pos.SetNext(node);
				pos = node;
			}

			return first;
		}

		public static Node<int> CreateIntListX(int length)
		{
			Random rnd = new Random();
			Node<int> first = new Node<int>(rnd.Next(100));
			Node<int> pos = first;
			for (int i = 1; i < length; i++)
			{
				Node<int> node = new Node<int>(rnd.Next(100));
				pos.SetNext(node);
				pos = node;
			}

			return first;
		}

		public static Node<int> CreateSortedIntList(int length)
		{
			Random rnd = new Random();
			Node<int> first = new Node<int>(rnd.Next(100));
			Node<int> pos = first;
			for (int i = 1; i < length; i++)
			{
				Node<int> node = new Node<int>(rnd.Next(pos.GetValue(), 100));
				pos.SetNext(node);
				pos = node;
			}

			return first;
		}

		public static void PrintIntNodeList(IntNode list)
		{
			while (list != null)
			{
				Console.Write(list);
				list = list.GetNext();
			}

			Console.WriteLine();
		}

		public static void PrintIntList(Node<int> list)
		{
			while (list != null)
			{
				Console.Write(list);
				list = list.GetNext();
			}

			Console.WriteLine();
		}

		public static void PrintCharList(Node<char> list)
		{
			while (list != null)
			{
				Console.Write(list);
				list = list.GetNext();
			}

			Console.WriteLine();
		}

		public static int[] ListToArray(Node<int> list, int length)
		{
			int[] arr = new int[length];
			for (int i = 0; i < length; i++)
			{
				arr[i] = list.GetValue();
				list = list.GetNext();
			}

			return arr;
		}

		public static Node<int> CreateIntList(int length)
		{
			Random r = new Random();
			int num = r.Next(0, 101);
			Node<int> n1 = new Node<int>(num);
			Node<int> pos = n1;
			Node<int> n2;
			for (int i = 1; i < length; i++)
			{
				num = r.Next(0, 101);
				n2 = new Node<int>(num);
				pos.SetNext(n2);
				pos = pos.GetNext();
			}

			return n1;
		}

		public static int GetMax(Node<int> list)
		{
			int max = list.GetValue();
			while (list != null)
			{
				if (list.GetValue() > max)
				{
					max = list.GetValue();
				}

				list = list.GetNext();
			}

			return max;
		}

		public static void CompressSequences(Node<char> list)
		{
			
		}

		public static Node<int> GetIt(Node<int> list, int num)
		{
			while (list != null)
			{
				if (list.GetValue() == num)
         		return list;
				list = list.GetNext();
			}

			return null;
		}

		public static Node<int> MergeLists(Node<int> list1, Node<int> list2)
		{
			
			Node<int> pos= list1;
			Node<int> temp=pos;
			while(pos!=null)
			{
				temp=pos;
				pos=pos.GetNext();
			}
			pos.SetNext(list2);
			Node<int> temp3=list1;
			Node<int> tempos1=list1;
			Node<int> tempos2=list1;
			while(tempos1!=null)
			{
				while(tempos2!=null)
				{
					if(tempos1<tempos2)
					{
						temp=temp

					}
					
					
				}
				
				
				
				
			}
			
			
			
			
			
			
		})
			{
				while (pos1 != null && pos2 != null)
				{
					if (alue() < pos2.GetValue())
					{
						Node<int> temp = list1;
						list1.SetNext(list2);
						list2.SetNext(temp.GetNext());
					}
					else
					{
						Node<int> temp = list2;
						list2.SetNext(list1);
						list1.SetNext(temp.GetNext());
					}
				}
			}
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
			public static int LongestSequence(Node<int> list)
			{
				Node<int> first=new Node<int> (0);
				
				Node<int> pos2=first;
				int count=0;
				while(list.GetNext()!=null)
				{
					if(list.GetValue()!=list.GetNext().GetValue())
						list=list.GetNext();
					else
					{
					while(list.GetValue()==list.GetNext().GetValue())
					{
						count++;
						list=list.GetNext();
					}
					}
					first.SetValue(count);
					first=first.GetNext();
					
				}
				int max=pos2.GetValue();
				while(pos2!=null)
				{
					if(pos2.GetValue()>max)
						max=pos2.GetValue();
				}
				return max;
			}

			public static bool IsListContains(Node<int> list1, Node<int> list2)
			{
				return true;
			}

			public static bool IsListTriple(IntNode list)
			{
				return true;
			}
		}

		public class IntNode
		{
			private int value;
			private IntNode next;
			public IntNode(int x)
			{
				this.value = x;
				this.next = null;
			}

			public IntNode(int x, IntNode next)
			{
				this.value = x;
				this.next = next;
			}

			public int Getvalue()
			{
				return (this.value);
			}

			public IntNode GetNext()
			{
				return (this.next);
			}

			public bool HasNext()
			{
				return (this.next != null);
			}

			public void SetValue(int x)
			{
				this.value = x;
			}

			public void SetNext(IntNode next)
			{
				this.next = next;
			}

			public override string ToString()
			{
				return (" " + this.value);
			}
		}

		public class StringNode
		{
			private string value;
			private StringNode next;
			public StringNode(string s)
			{
				this.value = s;
				this.next = null;
			}

			public StringNode(string s, StringNode next)
			{
				this.value = s;
				this.next = next;
			}

			public string Getvalue()
			{
				return (this.value);
			}

			public StringNode GetNext()
			{
				return (this.next);
			}

			public bool HasNext()
			{
				return (this.next != null);
			}

			public void SetValue(string s)
			{
				this.value = s;
			}

			public void SetNext(StringNode next)
			{
				this.next = next;
			}

			public override string ToString()
			{
				return (" " + this.value);
			}
		}

		public class Node<T>
		{
			private T value;
			private Node<T> next;
			public Node(T value)
			{
				this.value = value;
				this.next = null;
			}

			public Node(T value, Node<T> next)
			{
				this.value = value;
				this.next = next;
			}

			public T GetValue()
			{
				return this.value;
			}

			public Node<T> GetNext()
			{
				return this.next;
			}

			public bool HasNext()
			{
				return (this.next != null);
			}

			public void SetValue(T value)
			{
				this.value = value;
			}

			public void SetNext(Node<T> next)
			{
				this.next = next;
			}

			public override string ToString()
			{
				return this.value.ToString() + " ";
			}
		}
	}

​x
 
using System;
​
namespace CS4
{
    public class MainClass
    {
        public static void Main(string[] args)
        {
            Test16();
        }
​
        public static void Test2016B4()
        {
            int[] arr = {1, 3, 3, 4, 4, 4, 7, 8, 9, 10};
            IntNode list = ArrayToIntList(arr);
            Console.WriteLine("List:");
            PrintIntNodeList(list);
            bool isTripple = (IsListTriple(list));
            arr = new int[]{1, 3, 3, 4, 1, 3, 3, 4, 1, 3, 3, 4};
            Console.WriteLine("Tripple = " + isTripple);
            list = ArrayToIntList(arr);
            Console.WriteLine("List:");
            PrintIntNodeList(list);
            isTripple = IsListTriple(list);
            Console.WriteLine("Tripple = " + isTripple);
        }
​
        public static void Test18()
        {
            int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
            Node<int> list1 = ArrayToList(arr);
            Console.WriteLine("List1:");
            PrintIntList(list1);
            int[] arr2 = {1, 2, 11};
            Node<int> list2 = ArrayToList(arr2);
            Console.WriteLine("List2:");
            PrintIntList(list2);
            Console.WriteLine("IsListContains: " + IsListContains(list1, list2));
            int[] arr3 = {4, 2, 5};
            Node<int> list3 = ArrayToList(arr3);
            Console.WriteLine("List3:");
            PrintIntList(list3);
            Console.WriteLine("IsListContains: " + IsListContains(list1, list3));
        }
​
        public static void Test17()
        {
            int[] arr = {1, 3, 3, 4, 4, 4, 7, 8, 9, 10};
            Node<int> list = ArrayToList(arr);
            Console.WriteLine("List:");
            PrintIntList(list);
            int longest = LongestSequence(list);
            Console.WriteLine("Longest = " + longest);
        }
​
        public static void Test16()
                              
        {
            Node<int> list1 = CreateSortedIntList(3);
            Console.WriteLine("List1:");
            PrintIntList(list1);
            Node<int> list2 = CreateSortedIntList(3);               //N         A
            Console.WriteLine("List2:");
            PrintIntList(list2);
            Node<int> merged = MergeLists(list1, list2);
            Console.WriteLine("Merged:");
            PrintIntList(merged);
        }
​
        public static void Test15()
        {
            int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
            Node<int> list = ArrayToList(arr);
            PrintIntList(list);
            Node<int> node = GetIt(list, 7);
            Console.WriteLine(node);
            node = GetIt(list, 11);
            Console.WriteLine(node);
        }
​
        public static void Test14()
        {
            char[] chars = {'K', 'K', 'K', 'B', 'B', 'K', 'Z', 'E', 'E', 'Z'};
            Node<char> first = new Node<char>(chars[0]);
            Node<char> pos = first;
            for (int i = 1; i < chars.Length; i++)
            {
                Node<char> node = new Node<char>(chars[i]);
                pos.SetNext(node);
                pos = node;
            }
​
            CompressSequences(first);
            PrintCharList(first);
        }
​
        public static void Test13()
        {
            CreateIntList(5);
        }
​
        public static void TestArrayToList()
        {
            int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
            Node<int> list = ArrayToList(arr);
            PrintIntList(list);
        }
​
        public static void Test12()
        {
            int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
            Node<int> list1 = ArrayToList(arr);
            Console.WriteLine("List1:");
            PrintIntList(list1);
            Console.WriteLine("Max = " + GetMax(list1));
        }
​
        public static void TestStringNode()
        {
            bool toContinue = true;
            Console.WriteLine("Enter word:");
            StringNode first = new StringNode(Console.ReadLine());
            StringNode last = first;
            while (toContinue)
            {
                Console.WriteLine("Enter word:");
                string str = Console.ReadLine();
                if (str == "")
                {
                    toContinue = false;
                }
                else
                {
                    StringNode word = new StringNode(str);
                    last.SetNext(word);
                    last = word;
                }
            }
​
            StringNode pos = first;
            while (pos != null)
            {
                Console.Write(pos);
                pos = pos.GetNext();
            }
        }
​
        public static void TestIntNode()
        {
            Random rnd = new Random();
            int n = rnd.Next(100);
            IntNode first = new IntNode(n);
            IntNode pos = first;
            /*
             * Create another node, by a new random value: second
             */
            IntNode second = new IntNode(n);
            pos = first;
            for (int i = 0; i < 5; i++)
            {
                n = rnd.Next(100);
                pos.SetNext(new IntNode(n));
                pos = pos.GetNext();
            }
        }
​
        public static IntNode ArrayToIntList(int[] arr)
        {
            IntNode first = new IntNode(arr[0]);
            IntNode pos = first;
            for (int i = 1; i < arr.Length; i++)
            {
                IntNode node = new IntNode(arr[i]);
                pos.SetNext(node);
                pos = node;
            }
​
            return first;
        }
​
        public static Node<int> ArrayToList(int[] arr)
        {
            Node<int> first = new Node<int>(arr[0]);
            Node<int> pos = first;
            for (int i = 1; i < arr.Length; i++)
            {
                Node<int> node = new Node<int>(arr[i]);
                pos.SetNext(node);
                pos = node;
            }
​
            return first;
        }
​
        public static Node<int> CreateIntListX(int length)
        {
            Random rnd = new Random();
            Node<int> first = new Node<int>(rnd.Next(100));
            Node<int> pos = first;
            for (int i = 1; i < length; i++)
            {
                Node<int> node = new Node<int>(rnd.Next(100));
                pos.SetNext(node);
                pos = node;
            }
​
            return first;
        }
​
        public static Node<int> CreateSortedIntList(int length)
        {
            Random rnd = new Random();
            Node<int> first = new Node<int>(rnd.Next(100));
            Node<int> pos = first;
            for (int i = 1; i < length; i++)
            {
                Node<int> node = new Node<int>(rnd.Next(pos.GetValue(), 100));
                pos.SetNext(node);
                pos = node;
            }
​
            return first;
        }
​
        public static void PrintIntNodeList(IntNode list)
        {
            while (list != null)
            {
                Console.Write(list);
                list = list.GetNext();
            }
​
            Console.WriteLine();
        }
​
        public static void PrintIntList(Node<int> list)
        {
            while (list != null)
            {
                Console.Write(list);
                list = list.GetNext();
            }
​
            Console.WriteLine();
        }
​
        public static void PrintCharList(Node<char> list)
        {
            while (list != null)
            {
                Console.Write(list);
                list = list.GetNext();
            }
​
            Console.WriteLine();
        }
​
        public static int[] ListToArray(Node<int> list, int length)
        {
            int[] arr = new int[length];
            for (int i = 0; i < length; i++)
            {
                arr[i] = list.GetValue();
                list = list.GetNext();
            }
​
            return arr;
        }
​
        public static Node<int> CreateIntList(int length)
        {
            Random r = new Random();
            int num = r.Next(0, 101);
            Node<int> n1 = new Node<int>(num);
            Node<int> pos = n1;
            Node<int> n2;
            for (int i = 1; i < length; i++)
            {
                num = r.Next(0, 101);
                n2 = new Node<int>(num);
                pos.SetNext(n2);
                pos = pos.GetNext();
            }
​
            return n1;
        }
​
        public static int GetMax(Node<int> list)
        {
            int max = list.GetValue();
            while (list != null)
            {
                if (list.GetValue() > max)
                {
                    max = list.GetValue();
                }
​
                list = list.GetNext();
            }
​
            return max;
        }
​
        public static void CompressSequences(Node<char> list)
        {
            
        }
​
        public static Node<int> GetIt(Node<int> list, int num)
        {
            while (list != null)
            {
                if (list.GetValue() == num)
                return list;
                list = list.GetNext();
            }
​
            return null;
        }
​
        public static Node<int> MergeLists(Node<int> list1, Node<int> list2)
        {
            
            Node<int> pos= list1;
            Node<int> temp=pos;
            while(pos!=null)
            {
                temp=pos;
                pos=pos.GetNext();
            }
            pos.SetNext(list2);
            Node<int> temp3=list1;
            Node<int> tempos1=list1;
            Node<int> tempos2=list1;
            while(tempos1!=null)
            {
                while(tempos2!=null)
                {
                    if(tempos1<tempos2)
                    {
                        temp=temp
​
                    }
                    
                    
                }
                
                
                
                
            }
            
            
            
            
            
            
        })
            {
                while (pos1 != null && pos2 != null)
                {
                    if (alue() < pos2.GetValue())
                    {
                        Node<int> temp = list1;
                        list1.SetNext(list2);
                        list2.SetNext(temp.GetNext());
                    }
                    else
                    {
                        Node<int> temp = list2;
                        list2.SetNext(list1);
                        list1.SetNext(temp.GetNext());
                    }
                }
            }
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
            public static int LongestSequence(Node<int> list)
            {
                Node<int> first=new Node<int> (0);
                
                Node<int> pos2=first;
                int count=0;
                while(list.GetNext()!=null)
                {
                    if(list.GetValue()!=list.GetNext().GetValue())
                        list=list.GetNext();
                    else
                    {
                    while(list.GetValue()==list.GetNext().GetValue())
                    {
                        count++;
                        list=list.GetNext();
                    }
                    }
                    first.SetValue(count);
                    first=first.GetNext();
                    
                }
                int max=pos2.GetValue();
                while(pos2!=null)
                {
                    if(pos2.GetValue()>max)
                        max=pos2.GetValue();
                }
                return max;
            }
​
            public static bool IsListContains(Node<int> list1, Node<int> list2)
            {
                return true;
            }
​
            public static bool IsListTriple(IntNode list)
            {
                return true;
            }
        }
​
        public class IntNode
        {
            private int value;
            private IntNode next;
            public IntNode(int x)
            {
                this.value = x;
                this.next = null;
            }
​
            public IntNode(int x, IntNode next)
            {
                this.value = x;
                this.next = next;
            }
​
            public int Getvalue()
            {
                return (this.value);
            }
​
            public IntNode GetNext()
            {
                return (this.next);
            }
​
            public bool HasNext()
            {
                return (this.next != null);
            }
​
            public void SetValue(int x)
            {
                this.value = x;
            }
​
            public void SetNext(IntNode next)
            {
                this.next = next;
            }
​
            public override string ToString()
            {
                return (" " + this.value);
            }
        }
​
        public class StringNode
        {
            private string value;
            private StringNode next;
            public StringNode(string s)
            {
                this.value = s;
                this.next = null;
            }
​
            public StringNode(string s, StringNode next)
            {
                this.value = s;
                this.next = next;
            }
​
            public string Getvalue()
            {
                return (this.value);
            }
​
            public StringNode GetNext()
            {
                return (this.next);
            }
​
            public bool HasNext()
            {
                return (this.next != null);
            }
​
            public void SetValue(string s)
            {
                this.value = s;
            }
​
            public void SetNext(StringNode next)
            {
                this.next = next;
            }
​
            public override string ToString()
            {
                return (" " + this.value);
            }
        }
​
        public class Node<T>
        {
            private T value;
            private Node<T> next;
            public Node(T value)
            {
                this.value = value;
                this.next = null;
            }
​
            public Node(T value, Node<T> next)
            {
                this.value = value;
                this.next = next;
            }
​
            public T GetValue()
            {
                return this.value;
            }
​
            public Node<T> GetNext()
            {
                return this.next;
            }
​
            public bool HasNext()
            {
                return (this.next != null);
            }
​
            public void SetValue(T value)
            {
                this.value = value;
            }
​
            public void SetNext(Node<T> next)
            {
                this.next = next;
            }
​
            public override string ToString()
            {
                return this.value.ToString() + " ";
            }
        }
    }

Enter Month

Last Run:	2:41:48 pm
Compile:	0.189s
Execute:	0s
Memory:	32kb
CPU:	0s

View IL Code