Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.HashMap;
- import java.util.Set;
- public class Zadania {
- public static void main(String[] args) {
- //Zadanie 1
- /*
- float[] tab1,tab2;
- tab1 = new float[(int) (Math.random() * 6+1)];
- tab2 = new float[(int) (Math.random() * 3+1)];
- fillTab(tab1);
- fillTab(tab2);
- printTab(tab1);
- printTab(tab2);
- float[] tab3 = joinTabs(tab1, tab2);
- printTab(tab3);
- */
- //Zadanie 2
- /*
- int[] tab = {1,2,3,4,4,3,2,1};
- boolean res = isPalindrome(tab);
- System.out.println(res);
- */
- //Zadanie 3
- /*
- double[] tab = new double[10];
- //double[] tab = {1,2,3};
- fillTabZad3(tab);
- printDoubleTab(tab);
- Zad3(tab);
- */
- //Zadanie 4
- /*
- char tab[] = {'a','b','c','a','k'};
- Zad4(tab);
- */
- //Zadanie 5
- /*
- byte[] tab = new byte[10];
- fillByte(tab);
- printByte(tab);
- Zad5(tab);
- */
- }
- public static void Zad5(byte[] tab) {
- byte[] parzyste,nieparzyste;
- int licznik=0,licznik2=0;
- for(int i=0; i<tab.length;i++) {
- if(tab[i] % 2 == 0) {
- licznik++;
- }else
- {
- licznik2++;
- }
- }
- parzyste = new byte[licznik];
- nieparzyste = new byte[licznik2];
- System.out.println("rozmiar parzyste = " + parzyste.length);
- System.out.println("rozmiar nieparzyste = " + nieparzyste.length);
- }
- public static void fillByte(byte[] tab) {
- for(int i=0; i<tab.length; i++) {
- tab[i] = (byte)(Math.random() * 5);
- }
- }
- public static void printByte(byte[] tab) {
- for(int i=0; i<tab.length; i++) {
- System.out.print(tab[i] + ", ");
- }
- }
- public static void Zad4(char[] tab) {
- HashMap<Character, Integer> znaki = new HashMap<Character,Integer>();
- for(int i=0; i<tab.length; i++) {
- if(znaki.get(tab[i]) == null){
- znaki.put(tab[i], 1);
- }else {
- znaki.put(tab[i], znaki.get(tab[i]) + 1);
- }
- }
- for (Character key: znaki.keySet()) {
- System.out.println("znak : " + key);
- System.out.println("ilosc powtorzen : " + znaki.get(key));
- }
- }
- public static void Zad3(double[] tab) {
- for(int i=0; i<tab.length; i++) {
- boolean tmp = true;
- for(int j=0; j<i; j++) {
- if(tab[i] > tab[j]) {
- }else
- {
- tmp = false;
- }
- }
- for(int j=tab.length-1; j>i; j--) {
- if(tab[i] < tab[j]) {
- }else {
- tmp = false;
- }
- }
- if(tmp) {
- System.out.println("index: " + i + " wartosc: " + tab[i]);
- }
- }
- }
- public static void printDoubleTab(double[] tab) {
- for(int i=0; i<tab.length;i++) {
- System.out.print(tab[i] + ",");
- }
- System.out.println();
- }
- public static void fillTabZad3(double[] tab) {
- for(int i=0; i<tab.length;i++) {
- tab[i] = Math.random()*20 - 10;
- }
- }
- public static boolean isPalindrome(int[] tab) {
- for(int i=0; i<(tab.length/2)+1;i++) {
- if(tab[i] == tab[tab.length-1-i]){
- }else {
- return false;
- }
- }
- return true;
- }
- public static void fillTab(float[] tab) {
- for(int i=0; i<tab.length;i++) {
- tab[i] = (float)Math.random()*100;
- }
- }
- public static void printTab(float[] tab) {
- for(int i=0; i<tab.length;i++) {
- System.out.print(tab[i] + ",");
- }
- System.out.println();
- }
- public static float[] joinTabs(float[] tab1, float[] tab2) {
- float[] res = new float[tab1.length + tab2.length];
- for(int i=0,j=0,k=0; i<res.length;i++) {
- if(j >= tab1.length || k >= tab2.length) {
- if(j >= tab1.length) {
- res[i] = tab2[k++];
- }else {
- res[i] = tab1[j++];
- }
- }else {
- if(i%2==0) {
- res[i] = tab1[j++];
- }
- else {
- res[i] = tab2[k++];
- }
- }
- }
- return res;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement