请教一个算算法，时间复杂度能否为n

给定一个数组$a=[["h":"01","c":1],["h":"03","c":1],["h":"05","c":1],["h":"06","c":1]],
另一个数组$b=["00","01","02","03","04","05","06","07"]
组合成数组$c,$c的格式与$a一致，没有'c'值的，补为0 ，类似于$c=[["h":"00","c":0],["h":"01","c":1],["h":"02","c":0],["h":"03","c":1],["h":"04","c":0],["h":"05","c":1],["h":"06","c":1],["h":"07","c":0]],这种的