Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive).

class Solution {
public int countOdds(int low, int high) {
int interval = high - low - 1;
int res = 0;
if (interval == -1) {
if (low % 2 == 1) return 1;
else return 0;
} else if (interval == 0) {
if (low % 2 == 1) res++;
if (high % 2 == 1) res++;
} else if (low % 2 != 0 && high % 2 != 0) {
if (interval % 2 != 0) res = interval / 2 + 2;
} else if (low % 2 == 0 && high % 2 == 0) {
res = interval / 2 + 1;
} else {
if (low % 2 == 1 || high % 2 == 1) {
res = interval / 2 + 1;
}
}
return res;
}
}