LEB128 algorithm performs unnecessary heap allocations

The current approach allocates a List<byte>, builds the result, allocates a byte[] and copies to it (via .ToArray()), and then takes that and copies it to a segment of another byte[]. That's two heap allocations and one additional bit blit that are unnecessary. The algorithm can instead write directly to the target array.