Algorithm problems are becoming increasingly important in coding tests, and many companies place great emphasis on the ability to solve these problems. In this course, we will address the issue of dividing given line segments into groups. This problem can be solved through efficient classification and sorting, as well as grouping logic.<\/p>\n
When given line segments are represented as points on a map, write a program to divide these segments into overlapping segment groups. A segment has a starting point and an endpoint, and is provided in the following input format:<\/p>\n
5<\/code>
\n1 3<\/code>
\n2 5<\/code>
\n6 8<\/code>
\n7 9<\/code>
\n10 12<\/code>\n<\/div>\nThe first line of the above input indicates the number of segments, and the following lines represent the starting and ending points of each segment. Overlapping segments must be grouped together. For example, the input segments can be divided as follows:<\/p>\n
\nOutput Example:<\/strong>
\nGroup 1: (1, 5)<\/code>
\nGroup 2: (6, 9)<\/code>
\nGroup 3: (10, 12)<\/code>\n<\/div>\nApproach to Solve the Problem<\/h2>\n
To solve this problem, the following approach can be used:<\/p>\n
\n- Store the line segments provided in the input in a list.<\/li>\n
- Sort the list based on the starting points.<\/li>\n
- Traverse the sorted list to group the overlapping segments.<\/li>\n
- Finally, output the range of continuous segments for each group.<\/li>\n<\/ol>\n
Step 1: Input Processing<\/h3>\n
First, we will define a structure to receive the segments input by the user and process the input. This structure will hold the starting point and endpoint of the segments, managing them in list form.<\/p>\n
using System;\nusing System.Collections.Generic;\n\npublic class Segment{\n public int Start { get; set; }\n public int End { get; set; }\n \n public Segment(int start, int end){\n Start = start;\n End = end;\n }\n}<\/code><\/pre>\nStep 2: Sorting<\/h3>\n
This is the code to sort the segment list based on starting points. This will bring similar segments closer together, preparing us to group them.<\/p>\n
public List<Segment> SortSegments(List<Segment> segments){\n segments.Sort((a, b) => a.Start.CompareTo(b.Start));\n return segments;\n}<\/code><\/pre>\nStep 3: Grouping Logic<\/h3>\n
The grouping logic determines whether each segment can be added to the current group while traversing. If the starting point of the current segment is less than or equal to the endpoint of the last segment, it is included in the same group. Otherwise, a new group is started.<\/p>\n
public List<List<Segment>> GroupSegments(List<Segment> segments){\n List<List<Segment>> groups = new List<List<Segment>>();\n groups.Add(new List<Segment>());\n \n foreach(var segment in segments){\n var lastSegment = groups[groups.Count - 1];\n if(lastSegment.Count == 0 || segment.Start > lastSegment[lastSegment.Count - 1].End){\n groups.Add(new List<Segment>());\n }\n groups[groups.Count - 1].Add(segment);\n }\n\n return groups;\n}<\/code><\/pre>\nStep 4: Final Output<\/h3>\n
Finally, we output the grouped results. The results are displayed in a simple text format based on the starting and ending points of each group.<\/p>\n
public void PrintGroups(List<List<Segment>> groups){\n for(int i = 0; i < groups.Count; i++){\n var group = groups[i];\n if(group.Count > 0){\n Console.WriteLine($\"Group {i + 1}: ({group[0].Start}, {group[group.Count - 1].End})\");\n }\n }\n}<\/code><\/pre>\nComplete Code<\/h2>\n
Now let’s write the final code by combining all the steps:<\/p>\n
using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n public class Segment\n {\n public int Start { get; set; }\n public int End { get; set; }\n\n public Segment(int start, int end)\n {\n Start = start;\n End = end;\n }\n }\n\n public static void Main(string[] args)\n {\n int n = int.Parse(Console.ReadLine());\n List<Segment> segments = new List<Segment>();\n\n for (int i = 0; i < n; i++)\n {\n var input = Console.ReadLine().Split(' ');\n int start = int.Parse(input[0]);\n int end = int.Parse(input[1]);\n segments.Add(new Segment(start, end));\n }\n\n segments = SortSegments(segments);\n var groups = GroupSegments(segments);\n PrintGroups(groups);\n }\n\n public static List<Segment> SortSegments(List<Segment> segments)\n {\n segments.Sort((a, b) => a.Start.CompareTo(b.Start));\n return segments;\n }\n\n public static List<List<Segment>> GroupSegments(List<Segment> segments)\n {\n List<List<Segment>> groups = new List<List<Segment>>();\n groups.Add(new List<Segment>());\n\n foreach (var segment in segments)\n {\n var lastSegment = groups[groups.Count - 1];\n if (lastSegment.Count == 0 || segment.Start > lastSegment[lastSegment.Count - 1].End)\n {\n groups.Add(new List<Segment>());\n }\n groups[groups.Count - 1].Add(segment);\n }\n\n return groups;\n }\n\n public static void PrintGroups(List<List<Segment>> groups)\n {\n for (int i = 0; i < groups.Count; i++)\n {\n var group = groups[i];\n if (group.Count > 0)\n {\n Console.WriteLine($\"Group {i + 1}: ({group[0].Start}, {group[group.Count - 1].End})\");\n }\n }\n }\n}<\/code><\/pre>\nConclusion<\/h2>\n
Through this course, we explored how to solve the segment grouping problem and how to write code using C#. In coding tests, it is important to develop algorithmic thinking through a variety of problems. Practice different types of problems through repetitive exercises!<\/p>\n
Additional Learning Resources<\/h2>\n
Here are some useful resources introduced during the process of solving this problem:<\/p>\n
\n- Programmers<\/a>: A platform providing various algorithm problems.<\/li>\n
- LeetCode<\/a>: A site providing domestic and international problems for algorithm practice.<\/li>\n
- Baekjoon Online Judge<\/a>: A site where you can solve algorithm problems of various difficulties.<\/li>\n<\/ul>\n
I hope this article helps in your coding test preparation. If you have any questions or additional inquiries, please leave a comment. Thank you!<\/p>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"