Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package chapter6;
- public class ArrayMethods
- {
- private int[] values;
- public ArrayMethods(int[] initialValues)
- {
- values = initialValues;
- }
- public void swapFirstAndLast()
- {
- int first = values[0];
- int last = values.length;
- values[0] = values[last-1];
- values[last-1] = last;
- }
- public void shiftRight()
- {
- int temp = values[values.length - 1];
- if(values.length > 1)
- {
- System.arraycopy(values,0,values,1, values.length - 1);
- }
- values[0] = temp;
- }
- public void replaceAllEvensZero()
- {
- for (int i = 0; i <= values.length; i++)
- {
- if(i % 2 == 0)
- {
- values[i] = 0;
- }
- }
- }
- public void replaceLargestNeighbors()
- {
- for (int i = 0; i <= values.length; i++)
- {
- if( i != 0 || i != values.length)
- {
- if (values[i + 1] > values[i - 1])
- {
- values[i] = values[i + 1];
- }
- else if (values[i - 1] > values[i + 1])
- {
- values[i] = values[i=1];
- }
- }
- }
- }
- public void removeMiddleNumber(int currentSize)
- {
- currentSize = values.length;
- if (values.length % 2 == 0)
- {
- for (int i = (values.length - (values.length * (1/2))) + 1; i < currentSize; i++)
- {
- values[i - 1] = values[i];
- }
- currentSize--;
- }
- else if (values.length % 2 != 0)
- {
- for (int i = (values.length - values.length % 2) + 1; i < currentSize; i++)
- {
- values[i - 1] = values[i];
- }
- currentSize--;
- }
- }
- public void moveEvenstoThefront()
- {
- for (int i = 0; i <= values.length; i++)
- {
- int swapPos = 0;
- if (values[i] % 2 == 0)
- {
- int temp = values[swapPos];
- values[swapPos] = values[i];
- values[i] = temp;
- swapPos += 1;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement