xxxxxxxxxx
class Solution {
public boolean isPalindrome(int x) {
int temp = x;
int dig, sum=0;
while(temp > 0)
{
dig = temp % 10;
sum = sum * 10 + dig;
temp = temp / 10;
}
if(sum == x)
return true;
else
return false;
}
}
xxxxxxxxxx
class Solution {
public int removeElement(int[] nums, int val) {
int count =0;
int j = 0;
for(int i=0; i<nums.length; i++){
if(nums[i]==val){
count+=1;
continue;
}
nums[j] = nums[i];
j++;
}
return nums.length-count;
}
}
//Remove Element