The data structure-CodePudding

Coding algorithm, is removed from the order form since the first I elements of k element, if not enough k element, element behind will I delete all,

CodePudding user response:

Before you judge if I have enough elements to K behind enough, just delete, delete principle starts well below the location of the deleted element moves forward,
If not directly remove the general idea is that the hope can help you

CodePudding user response:

refer to 1st floor @ big fool @ reply:

before you judge if I have enough elements to K behind enough, just delete, delete principle starts well below the location of the deleted element moves forward,
If not directly remove the general train of thought, the hope can help you

Can help to write it for me? If not enough k element, element behind will I delete all this paragraph

CodePudding user response:

reference changfeng ~ 2 floor response:

Quote: refer to 1st floor @ big fool @ reply:
before you judge if I have enough elements to K behind enough, just delete, delete principle starts well below the location of the deleted element moves forward,
If not directly remove the general train of thought, the hope can help you

Can help to write it for me? If not enough k element, element behind will I delete all this

Thank you thank you very much

CodePudding user response:

reference changfeng ~ 2 floor response:

Quote: refer to 1st floor @ big fool @ reply:
before you judge if I have enough elements to K behind enough, just delete, delete principle starts well below the location of the deleted element moves forward,
If not directly remove the general train of thought, the hope can help you

Can help to write it for me? If not enough k element, element behind will I delete all this

Directly modifying sequence length is equal to delete the table from the I start element