class Solution {
public:
int pivotIndex(vector<int>& nums) {
int total = 0;
for(auto s:nums)
{
total += s;
}
int sum = 0;
for(int i = 0;i<nums.size();++i)
{
if(2*sum+nums[i] == total)
{
return i;
}
sum += nums[i];
}
return -1;
}
};
class Solution {
public:
int numberOfSteps(int num) {
int sum = 0;
while(num != 0)
{
if(num % 2 == 0)
{
num /= 2;
}
else
{
num -= 1;
}
sum++;
}
return sum;
}
};