bankertapan
BAN USERpublic void putNumbersAtEnd(int[] arrayNum)
{
if(arrayNum.length < 2) return;
int pointer1=0;
int pointer2=1;
int temp;
while(pointer2 <arrayNum.length)
{
if(arrayNum[pointer1]==0 && arrayNum[pointer2]!=0)
{
//Swap the values
temp =arrayNum[pointer1];
arrayNum[pointer1] = arrayNum[pointer2];
arrayNum[pointer2] = temp;
}
if(arrayNum[pointer1]!=0)
{
pointer1++;
}
pointer2++;
}
}
public int[] mergeSortedArray(int[] array1, int sizeA, int[] array2)
{
int i=sizeA;
int j = array2.length-1;
int k = array1.length -1;
while(k>=0 && i>=0 && j>=0)
{
if(array1[i] > array2[j])
{
array1[k]=array1[i];
k--;
i--;
}
else
{
if(j>=0)
{
array1[k]=array2[j];
}
k--;
j--;
}
}
return array1;
}
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
return oddNumbersSet;
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++)
if(oddNumbersSet.contains(number[i]))
oddNumbersSet.remove(number[i]);
else
oddNumbersSet.add(number[i]);
return oddNumbersSet;
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
{
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
{
return oddNumbersSet;
}
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++){
if(oddNumbersSet.contains(number[i]))
{
oddNumbersSet.remove(number[i]);
}
else
{
oddNumbersSet.add(number[i]);
}
}
return oddNumbersSet;
}
//Find oddnumber in array
public Set<Integer> getListOfOddNumbers(int[] number)
{
Set<Integer> oddNumbersSet = new HashSet<Integer> (number.length);
if(number.length<0 || number==null)
{
return oddNumbersSet;
}
int i;
//Iterate each element in the array
for(i=0;i<number.length;i++){
if(oddNumbersSet.contains(number[i]))
{
oddNumbersSet.remove(number[i]);
}
else
{
oddNumbersSet.add(number[i]);
}
}
return oddNumbersSet;
}
1. Sort the Array
2. Take two pointers left (start of the array) and right (end of the array)
3. Find the sum of the left and right value in the array
4. Look up iteratively the sum within the subarray , if sum is found print it
4.a if sum is greater value then increment left side ( i ) or else reduce the (j) value
-- This solution do not use any extra space , no HashMap
- bankertapan October 12, 2014