If we restrict $r, s$ to only $\mathbb{Z}$, it's easy to prove that the only possibilities are $r = s \in \{1,2 \}$, but I haven't been able to prove this more general case.
Also, is it significantly harder to answer this questions if, say, $r, s \in \mathbb{R}$?
(as pointed out in the comments, there's a trivial solution to the problem... the question becomes much more interesting without that, so I've edited the question)
Let $r+s=m$, $\frac1r+\frac1s=n$. So we want $$ nr^2-mnr+m=0 $$ So we want $\Delta=(mn)^2-4mn=(mn-2)^2-4$ to be a perfect square (in $\mathbb{Q}$ or in $\mathbb{R}$). For $\mathbb{Q}$, integer perfect squares are of course square of integers, so we must have $mn-2=\pm 2$ which yields the trivial solutions $mn=0$, or $mn=4$, which are $r=s\in\{\pm 1,\pm 2\}$.
For $\mathbb{R}$, we have much more freedom. Any $mn\neq 1,2,3$ (and $mn\neq 0$ to rule out trivial solutions) would work, as $\Delta\geq 0$, we can take its square-root $\sqrt{\Delta}\in\mathbb{R}$ and obtain: $$ r=\frac{mn\pm\sqrt{\Delta}}{2n},s=\frac{mn\mp\sqrt{\Delta}}{2n} $$