First clear solution for Merge Intervals by TianPu8153 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for Merge Intervals by TianPu8153

def merge_intervals(intervals):
    i=0
    result=[]
    while i < len(intervals):
        start=intervals[i][0]
        end=intervals[i][1]
        while(i < len(intervals)-1) and  (end >=intervals[i+1][0] or intervals[i+1][0]-end <= 1):
            if(end 
                        Nov. 14, 2018

                        
                            Comments:
                            
                                
                                    tigerhu3180
 on Nov. 14, 2018, 8:24 a.m.

                                    <p>my idea is as follows :</p>

<p>merge_intervals([(1, 4), (2, 6), (8, 10), (12, 19)])</p>

<blockquote>
  <p>=&gt; [(1,2,3,4),(2,3,4,5,6),(8,9,10),(12,13,14,....,19)] #using range</p>
  
  <p>=&gt; [1,2,3,4 , 2,3,4,5,6 , 8,9,10 , 12,13,...,19] #using slice</p>
  
  <p>=&gt; [1,2,3,4,5,6, 8,9,10 ,12,13,14,...19] #using set</p>
  
  <p>=&gt; [(1, 6), (8, 10), (12, 19)] #...</p>
</blockquote>

                                
                            
                                
                                    tigerhu3180
 on Nov. 14, 2018, 8:36 a.m.

                                    <p>我看不懂你的思路，解释解释？顺便给你个顶吧</p>

                                
                            
                                
                                    TianPu8153
 on Nov. 15, 2018, 1:17 a.m.

                                    <p>Your idea is right and easier to understand.
I set "start" and "end" to record the range . If the current range contains next range,go on. If they are adjacent or across ,“end” will change. </p>

                                
                            
                                
                                    tigerhu3180
 on Nov. 15, 2018, 2:05 a.m.

                                    <p>fail on merge_intervals([(5,7),(4,8)]) </p>

<p>your answer is [(5, 8)]</p>

<p>right answer is [(4, 8)]</p>

                                
                            
                                
                                    tigerhu3180
 on Nov. 15, 2018, 2:11 a.m.

                                    <p>oh, I ignore that precondition</p>

<p>intervals == sorted(intervals, key=lambda x: x[0]) # sorted by 1st element of the tuples
interval[0] &lt;= interval[1]</p>

<p>You are lucky.</p>

                                
                            
                                
                                    TianPu8153
 on Nov. 15, 2018, 3:52 a.m.

                                    <p>lucky？？？</p>

GitHub

0 %

CheckiO ClassRoom Don’t waste any time! Create your first class right now for free and help your students to learn programming more effectively.