Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package pgdp.arrays;
- public class GamesWithArrays {
- public static int[] otherSort(int[] arr, int[] arr2) {
- // TODO
- int result[] = new int[arr.length];
- int resultindex = 0;
- for(int i = 0; i < arr.length; i++)
- {
- result[resultindex] = arr2[i];
- int temp = result[resultindex];
- boolean already = false;
- int countersame = 0;
- for(int j = 0; j < resultindex; j++)
- {
- if(result[j] == result[resultindex])
- {
- already = true;
- }
- }
- if(already == false)
- {
- for(int j = 0; j < arr.length; j++)
- {
- if(arr[j] == temp)
- {
- countersame++;
- }
- }
- for(int j = 0; j < countersame - 1; j++)
- {
- resultindex++;
- result[resultindex] = arr2[i];
- }
- }
- resultindex++;
- }
- if(arr.length > arr2.length)
- {
- for(int i = 0; i < arr.length; i++)
- {
- boolean contains = false;
- for(int j = 0; j < result.length; j++)
- {
- if(result[j] == arr[i])
- {
- contains = true;
- }
- }
- if(contains == false)
- {
- result[resultindex] = arr[i];
- resultindex++;
- }
- }
- }
- return result;
- }
- public static int[] fairFriends(int[] arr, int[] arr2) {
- // TODO
- return new int[]{};
- }
- public static boolean alpen(int[] arr) {
- // TODO
- return true;
- }
- public static int[] plankton(int[] arr) {
- // TODO
- return new int[]{};
- }
- public static int pinguinFreunde(int[] arr) {
- // TODO
- return 0;
- }
- public static void main(String[] args)
- {
- int arr1 [] = {2,3,1,3,2,4,6,7,9,2,19};
- int arr2 [] = {2,1,4,3,9,6};
- int result[] = otherSort(arr1, arr2);
- for(int i = 0; i < result.length; i++)
- {
- System.out.println(result[i]);
- }
- return;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement