public class Solution {

public int removeDuplicates(int[] nums) {

int length=0;
int i=0;
int count=0;
if(nums.length>0){
while(i<nums.length){

if(nums[i]==nums[i+1]){
if(count==0){
count=1;
i++;
length++;
}
else{
i++;
}

}
else{
count=0;
}

}
}

return length;

}
}

public class Solution {

public int removeDuplicates(int[] nums) {
int length=0;
int i=0;
int count=0;
if(nums.length>0){
while(i<nums.length){

if(nums[i]==nums[i+1]){
if(count==0){
count=1;
i++;
length++;
}
else{
i++;
}

}
else{
count=0;
}

}
}
 return length;

}
}

public class Solution {

public int removeDuplicates(int[] nums) {
int length=0;
int i=0;
int count=0;
if(nums.length>0){
while(i<nums.length){

if(nums[i]==nums[i+1]){
if(count==0){
count=1;
i++;
length++;
}
else{
i++;
}

}
else{
count=0;
}

}
}

return length;

}
}

public class Solution {

public int removeDuplicates(int[] nums) {
int length=0;
int i=0;
int count=0;
if(nums.length>0){
while(i<nums.length){

if(nums[i]==nums[i+1]){
if(count==0){
count=1;
i++;
length++;
}
else{
i++;
}

}
 else{
count=0;
}

}
}

return length;

}
}

public class Solution {

public int removeDuplicates(int[] nums) {
int length=0;
int i=0;
int count=0;
if(nums.length>0){
while(i<nums.length){

if(nums[i]==nums[i+1]){
if(count==0){
count=1;
i++;
length++;
}
else{
i++;
}

}
else{
count=0;
}

}
}

return length;

}
}