# [Java (OpenJDK 8)], 70 bytes

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

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

[Try it online!][TIO-jfdfpykp]

[Java (OpenJDK 8)]: http://openjdk.java.net/
[TIO-jfdfpykp]: https://tio.run/##jY/NboMwEITvPMUesXCsEpL@WVTqAzSXHBGHreOkpmAjs6SKEM9OTWiPUXva1c7om9kKz7hyrbbV4XMyTes8QRVuoidTi1fv8dLJSNXYdfCGxg4RgLGk/RGVht0Q9qIEHy8TmRyDoSMko2AHFnKYcPUy28DkqbzaVG7110wpUNTanugjMaU8uisF@mdkqjBJUua99Jp6b0HJcZIB3PbvdQD/8M/OHKAJpeI9eWNPRYls7gewv3SkG@F6Em1QqLbx8oogt3hjK3z8W6McUr7mGd/wLb/nD/yRP/H0bmSMyVu428p/grYhIs34OuXZ5u@YMRqnbw "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;    //Initialize counter
    int[]c=new int[a.length+i];    //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