求个算法,遍历数组,得到更新部分的元素.
求算法:
数组X : [1...Max] Max = 10
Step1: [0xff],[0xff],[0xff],[0xff],[0xff],[0xff],[0xff],[0xff],[0xff],[0xff]
输出 =
Step2: [0x01],[0x02],[0x11],[0x41],[0xff],[0xff],[0xff],[0xff],[0xff],[0xff]
---- ---- ---- ----
输出 = [0x01],[0x02],[0x11],[0x41]
Step3: [0x01],[0x02],[0x11],[0x41],[0x1f],[0xff],[0xff],[0x00],[0xff],[0xff]
---- --== --== ----
输出 = [0x1f],[0xf1],[0x1f],[0x00]
Step4: [0x11],[0x02],[0x11],[0x41],[0x1f],[0xff],[0xff],[0x00],[0x04],[0x23]
---- ---- ----
输出 = [0x04],[0x23],[0x11]
...