c# 合并重叠时间段的算法

c# 合并重叠时间段的算法

一.采用非排序：

方案一：

使用递归算法，如不喜欢递归的伙伴们，可以使用whie代替。

1.文件：Extract_Chao.cs（核心）

 using System;
 using System.Collections.Generic;
 using System.Linq;
 using System.Text;
 using System.Threading.Tasks;

 namespace Extract
 {
     public class Extract_Chao
     {
         List<ExtractInfo> extractList = new List<ExtractInfo>();
         public void Main()
         {
             var list = AddExtract();
             BuidExtract(list, );

             for (int i = ; i < extractList.Count; i++)
             {
                 if (extractList[i] == null) continue;
                 Console.WriteLine(extractList[i].StartPoint + "-------" + extractList[i].EndPoint);
             }
         }

         private void BuidExtract(List<ExtractInfo> list, int num)
         {
             for (int i = ; i < list.Count; i++)
             {
 　　　　　　　　　　if(i==num)continue;

                 if (list[i] != null &&list[num]!=null)
                 {
                     if (list[i].StartPoint > list[num].StartPoint && list[i].StartPoint <= list[num].EndPoint)
                     {
                         if (list[i].EndPoint > list[num].EndPoint)
                         {
                             var extractTemp = new ExtractInfo() { StartPoint = list[num].StartPoint, EndPoint = list[i].EndPoint };
                             list[num] = extractTemp;
 　　　　　　　　　　　　　　　　//如果数组有变化，那么就重新递归回调，（我的死穴）
 　　　　　　　　　　　　　　　　　num=;
 　　　　　　　　　　            BuidExtract(list,num);
                         }
                         list[i] = null;
                     }
                 }
             }

             num++;

             if (num < list.Count)
             {
                 BuidExtract(list, num);
             }
             else
             {
                 extractList = list;
             }

         }

         private List<ExtractInfo> AddExtract()
         {
             var list = new List<ExtractInfo>();
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });

             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });

             return list;
         }

     }
 }

2. 文件：ExtractInfo.cs（实体）

  public class ExtractInfo
    {
        public double StartPoint { get; set; }

        public double EndPoint { get; set; }
    }

3.文件：Program.cs（入口）

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Extract
{
    class Program
    {
        static void Main(string[] args)
        {

            Extract_Chao chao = new Extract_Chao();
            chao.Main();

            Console.WriteLine("OK");
            Console.Read();
        }
    }
}

4.运行结果：

方案二：

文件：ExtractPoint_Zhang3.cs（核心代码）

 using System;
 using System.Collections.Generic;
 using System.Linq;
 using System.Text;
 using System.Threading.Tasks;

 namespace Extract
 {
     /// <summary>
     /// 不排序，递归算法，当集合有变化，回调
     /// </summary>
     public class ExtractPoint_Zhang3
     {
         List<ExtractInfo> extractList = new List<ExtractInfo>();
         public void Main()
         {
             extractList = AddExtract();
             Console.WriteLine("运算前数据如下:");
             for (int i = ; i < extractList.Count; i++)
             {
                 Console.WriteLine(extractList[i].StartPoint + "---" + extractList[i].EndPoint);
             }

             BuidExtract();
             Console.WriteLine();
             Console.WriteLine("运算后数据如下:");
             for (int i = ; i < extractList.Count; i++)
             {
                 if (extractList[i] == null) continue;
                 Console.WriteLine(extractList[i].StartPoint + "---" + extractList[i].EndPoint);
             }
         }

         private void BuidExtract()
         {
             for (int i = ; i < extractList.Count; i++)
             {
                 if (IsMerge(i))
                 {
                     BuidExtract();
                 }
             }
         }

         private bool IsMerge(int num)
         {
             var isContinue = false;

             for (int i = ; i < extractList.Count; i++)
             {
                 if (num == i) continue;

                 if (extractList[i].StartPoint > extractList[num].StartPoint && extractList[i].StartPoint <= extractList[num].EndPoint)
                 {
                     if (extractList[i].EndPoint > extractList[num].EndPoint)
                     {
                         var extractTemp = new ExtractInfo() { StartPoint = extractList[num].StartPoint, EndPoint = extractList[i].EndPoint };

                         var tempI = extractList[i];
                         var tempNum = extractList[num];
                         extractList.Remove(tempI);
                         extractList.Remove(tempNum);
                         extractList.Add(extractTemp);

                     }
                     else
                     {
                         var tempI = extractList[i];
                         extractList.Remove(tempI);
                     }

                     isContinue = true;
                     break;
                 }
             }
             return isContinue;
         }

         private List<ExtractInfo> AddExtract()
         {
             var list = new List<ExtractInfo>();
             //list.Add(new ExtractInfo() { StartPoint = 5, EndPoint = 10 });
             //list.Add(new ExtractInfo() { StartPoint = 20, EndPoint = 30 });
             //list.Add(new ExtractInfo() { StartPoint = 6, EndPoint = 25 });

             //list.Add(new ExtractInfo() { StartPoint = 24, EndPoint = 41 });
             //list.Add(new ExtractInfo() { StartPoint = 58, EndPoint = 75 });
             //list.Add(new ExtractInfo() { StartPoint = 62, EndPoint = 80 });
             //list.Add(new ExtractInfo() { StartPoint = 79, EndPoint = 89 });
             //list.Add(new ExtractInfo() { StartPoint = 89, EndPoint = 100 });

             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             list.Add(new ExtractInfo() { StartPoint = , EndPoint =  });

             return list;
         }

     }
 }

二.采用排序算法：

方案一：

http://www.cnblogs.com/artwl/archive/2011/03/01/1968044.html

地址失效解决方案：

函数：Union（核心代码）

   public void Union()
         {
             //先对数据排序
             extractList = extractList.OrderBy(p => p.StartPoint).ToList<ExtractInfo>();
             for (int i = ; i < extractList.Count - ; i++)
             {
                 int j = i + ;
                 if (extractList[i].EndPoint >= extractList[j].StartPoint)
                 {
                     //处理后一条数据的结束时间比前一条数据结束时间小的情况
                     if (extractList[i].EndPoint >= extractList[j].EndPoint)
                     {
                         extractList[j] = extractList[i];
                     }
                     else
                     {
                         extractList[j].StartPoint = extractList[i].StartPoint;
                     }
                     extractList[i] = null;
                 }
                 else
                 {
                     i++;
                 }
             }
         }

此算法甚好的，只是不满足我的需求：（上一个终点等于下一个起点的时候）【根据自己的需求选择方案】

例如如下两段时间段：

5-10

10-20

我的需求结果是要合并：5-20

方案二：

文件：ExtractPoint_Zhang.cs（核心代码）

 using System;
 using System.Collections.Generic;
 using System.Linq;
 using System.Text;

 namespace Extract
 {
     /// <summary>
     /// 排序算法
     /// </summary>
     public class ExtractPoint_Zhang
     {
         List<ExtractInfo> extractListNew = new List<ExtractInfo>();

         public void Main()
         {
             var list = AddExtract();

             ExtractCombination(list);

             for (var i = ; i < extractListNew.Count; i++)
             {
                 Console.WriteLine(extractListNew[i].StartPoint + "----" + extractListNew[i].EndPoint);
             }
         }

         List<ExtractInfo> AddExtract()
         {
             var extractListOld = new List<ExtractInfo>();
             //extractListOld.Add(new ExtractInfo() { StartPoint = 5, EndPoint = 10 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 20, EndPoint = 30 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 6, EndPoint = 25 });

             //extractListOld.Add(new ExtractInfo() { StartPoint = 24, EndPoint = 41 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 58, EndPoint = 75 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 62, EndPoint = 80 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 79, EndPoint = 89 });
             //extractListOld.Add(new ExtractInfo() { StartPoint = 89, EndPoint = 100 });

             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });
             extractListOld.Add(new ExtractInfo() { StartPoint = , EndPoint =  });

             return extractListOld;
         }

         void ExtractCombination(List<ExtractInfo> list)
         {
             var listNew = new List<ExtractInfo>();
             list = list.OrderBy(x => x.StartPoint).ToList<ExtractInfo>();

             for (int i = ; i < list.Count; )
             {
                 var num = i + ;

                 if (num >= list.Count) break;

                 if (list[num].StartPoint <= list[i].EndPoint)
                 {
                     if (list[num].EndPoint > list[i].EndPoint)
                     {
                         var extractTemp = new ExtractInfo();
                         extractTemp.StartPoint = list[i].StartPoint;
                         extractTemp.EndPoint = list[num].EndPoint;

                         var tempI = list[i];
                         var tempNum = list[num];
                         list.Remove(tempI);
                         list.Remove(tempNum);
                         list.Add(extractTemp);
                     }
                     else
                     {
                         var tempI = list[i];
                         list.Remove(tempI);
                     }
                     list = list.OrderBy(x => x.StartPoint).ToList<ExtractInfo>();
                     i = ;
                 }
                 else
                 {
                     i++;
                 }
             }
             extractListNew = list;
         }
     }
 }

更多方案见百度云盘：

http://pan.baidu.com/s/1nvjmNtn

思路决定程序出路

　　　　---逻辑与思维

欢迎大家分享更好的算法，独乐不如众乐！