Language to regular expression
If the language is finite like you have given in the question then regular expression is simple just write all string separated by $+$(union).
So $$r = 100 + 10 + 011$$
further you have something common in first two string so 
$$r= 10(0+\epsilon) + 011$$


  I feel like I'm overcomplicating it.


For that You need to learn three operators $*$ , $+$ and $.$ properly &amp; understand the language given then It will be easy for you to make a regular expression without making a D.F.A..