# [Java (OpenJDK 8)], 67 bytes

<!-- language-all: lang-java -->

    a->{int c[]=new int[a.length+1],i=1;for(int u:a)c[i++]=u;return c;}

[Try it online!][TIO-jfdynleh]

[Java (OpenJDK 8)]: http://openjdk.java.net/
[TIO-jfdynleh]: https://tio.run/##jY9NboMwEIX3nGKWWDhWHZL@WVTqAZpNlsiLqeOkpmCQsVNFiLNTU9pl1KxmNPPme28qPOOq7bStDp@TabrWeajijAVvavbqHF56kaga@x7e0NghATDWa3dEpWE3xL6U4NKlIhFjFPQevVGwAwsFTLh6mWWgSllY/TWfl8hqbU/@I@OSmoKLY/uDgPCMRJUmy2QRhNM@OAtKjJOI1C6815H6Cz@35gBNTJTuvTP2VEokcziA/aX3umFt8KyLG1/bdPmD@XbRppa59C@KHDhd05xu6Jbe0wf6SJ8ovxsJIeIa7vrmFqNttOA5XXOab/63GZNx@gY "Java (OpenJDK 8) – Try It Online"

This was a fun little challenge in Java since Java arrays are static in size, but it seems like this is significantly less challenging in every language that can just slap a zero on for the first- excuse me, *zeroth* element


    int i=1,c[]=new int[a.length+i];    ////Initialize counter and declare new array with length: 1 + input array length
    for(int u:a)    //Loop through each element in input array
      c[i++]=u;    //Increment counter after shifting each element up one spot in the output array
    return c;    //return new array starting at index 1


-3 bytes thanks to [Kevin Cruijssen](https://codegolf.stackexchange.com/users/52210/kevin-cruijssen)!