Keep Multiplying Found Values by Two LeetCode solution in Java

1
class Solution {
2
  public int findFinalValue(int[] nums, int original) {
3
    HashSet<Integer> set = new HashSet<>();
4
    for (int i : nums) if (i >= original) set.add(i);
5
    while (true)
6
      if (set.contains(original)) original *= 2;
7
      else break;
8
    return original;
9
  }
10
}