i guess that's because your algorithm is O(n * m),in my opinion, if you delete a 'sorted' sub set from a 'sorted' list, your algorithm can be O(m+n). please fix it, thank u.
This post has been edited by coolcorn: 04 December 2017 - 10:06 AM
Posted 04 December 2017 - 10:04 AM
This post has been edited by coolcorn: 04 December 2017 - 10:06 AM
Posted 05 December 2017 - 06:27 PM
This post has been edited by fox88: 06 December 2017 - 11:05 AM
Posted 01 June 2018 - 03:04 AM
fox88, on 05 December 2017 - 06:27 PM, said:
Posted 01 June 2018 - 10:08 AM
coolcorn, on 01 June 2018 - 06:04 AM, said:
coolcorn, on 01 June 2018 - 06:04 AM, said: