Judge whether the two time ends contain intersection

One . introduction

I'm writing a piece of logic today , Judge whether the two time ends contain intersection . Suppose there are two time ends , One is timeA To timeB, The other is timeC To timeD. I drew on the draft book , This is the case ：

  Then I want to write these situations in code , Although it was finally written , But the process is hard .

The code is as follows ( Regardless of the critical value )：

(timeA.getTime() < timeC.getTime() && timeB.getTime() > timeC.getTime())  ||
(timeA.getTime() > timeC.getTime() && timeA.getTime() < timeD.getTime()

Two . Simple ideas

The above is normal thinking , Then I suddenly thought of the reverse thinking of middle school learning , In fact, it is to judge that there is no intersection between the two time ends , Then reverse it . The following is the case where there is no intersection between the two time ends ：

  The code is as follows ：

timeA.getTime > timeD.getTime || timeB.getTime < timeC.getTime()

The code to judge whether the two time ends contain intersection can be obtained by negating , as follows ：

timeA.getTime < timeD.getTime && timeB.getTime > timeC.getTime()

These can be easily judged .( Converse thinking ...)