Search This Blog

Showing posts with label Java Programming. Show all posts
Showing posts with label Java Programming. Show all posts

Wednesday, 9 April 2014

java program to convert char array to String

java program to convert char array to String



public class ConvertCharArrayToString {
       public static void main(String[] args) {
              char[] charArr = { 'w', 'e', 'l', 'c','o','m','e',' ','R', 'a',' j' };

              String str = new String(charArr);
              System.out.println("converted String is:" + str);

              String str1 = String.valueOf(charArr);
              System.out.println("covnverted String is:" + str1);
       }
}

OUTPUT
converted String is:welcome Raj
covnverted String is:welcome Raj

java program to convert String to char array

java program to convert String to char array


public class ConvertStringToCharArray {
       public static void main(String[] args) {
              String str="welcome Raj";
              char[] charArr=str.toCharArray();

              for(char temp:charArr){
                     System.out.println(temp);
              }
       }
}

OUTPUT
w
e
l
c
o
m
e

R
a
j

Reverse Array Elements in Java

Reverse Array Elements in Java



public class ReverseArray {
       public static void main(String[] args) {
              int[] intArr = new int[] { 1, 2, 3, 4, 5, 6, 7 };
              System.out.println("Array elements before reverse");
              displayArrayElements(intArr);
              reverseArrayElements(intArr);
              System.out.println("reversed array elements");
              displayArrayElements(intArr);
       }

       public static void displayArrayElements(int[] arr) {
              for (int temp : arr) {
                     System.out.println(temp);
              }
              System.out.println("..............................");
       }

       public static void reverseArrayElements(int[] arr) {
              int temp = 0;
              for (int start = 0, end = arr.length - 1; start < end; start++, end--) {
                     temp = arr[start];
                     arr[start] = arr[end];
                     arr[end] = temp;
              }

       }
}
output
Array elements before reverse
1
2
3
4
5
6
7
..............................
reversed array elements
7
6
5
4
3
2
1
..............................

Find Minimum and Maximum value of Array in Java


Find Minimum and Maximum value of Array in Java


public class FindMinAndMaxValueInArray {
       public static void main(String[] args) {
              int arr[] = { 69, 23, 47, 81, 92, 88, 52, 48, 56, 66, 65, 76, 71, 85,
                           49, 53, 56, 61, 65, 84 };
              findMaxValue(arr);
              findMinValue(arr);
       }

       public static void findMinValue(int[] arr) {
              int min = arr[0];
              for (int i = 0; i < arr.length; i++) {
                     if (min > arr[i]) {
                           min = arr[i];
                     }
              }
              System.out.println("minimum value of the array is:" + min);
       }

       public static void findMaxValue(int[] arr) {
              int max = arr[0];
              for (int i = 0; i < arr.length; i++) {
                     if (max < arr[i]) {
                           max = arr[i];
                     }
              }
              System.out.println("maximum value of array is:" + max);

       }
}
output
maximum value of array is:92
minimum value of the array is:23

Sunday, 6 April 2014

Find Duplicates in an array

Find Duplicates in an array


package com.blogspot.rajvishwakarma15;

public class CheckDuplictesInArray {
       public static void main(String[] args) {
              String[] strArr = new String[] { "a", "b", "c", "s", "d", "e", "a",
                           "b", "s" };
              detectDuplicates(strArr);
       }

       public static void detectDuplicates(String[] arr) {

              for (int i = 0; i < arr.length; i++) {
                     for (int j = i + 1; j < arr.length; j++) {
                           if (arr[j] == arr[i]) {
                      System.out.println("Duplicate found! Original was at location "
                               + (i + 1) + " and match is at " + (j + 1));
                                  System.out.println("Duplicated value is:" + arr[j]);
                           }
                     }
              }

       }
}


OUTPUT
Duplicate found! Original was at location 1 and match is at 7 Duplicated value is:a

Duplicate found! Original was at location 2 and match is at 8 Duplicated value is:b

Duplicate found! Original was at location 4 and match is at 9 Duplicated value is:s

Wednesday, 2 April 2014

Write a program to find the given number is Armstrong number or not?

Find the given number is Armstrong number or no ?

Description:
Armstrong numbers are the sum of their own digits to the power of
the number of digits. It is also known as narcissistic numbers.


package com.blogspot.rajvishwakarma18;

public class MyArmstrongNumber {
 
    public boolean isArmstrongNumber(int number){
         
        int tmp = number;
        int noOfDigits = String.valueOf(number).length();
        int sum = 0;
        int div = 0;
        while(tmp > 0)
        {
            div = tmp % 10;
            int temp = 1;
            for(int i=0;i<noOfDigits;i++){
                temp *= div;
            }
            sum += temp;
            tmp = tmp/10;
        }
        if(number == sum) {
            return true;
        } else {
            return false;
        }
    }
     
    public static void main(String a[]){
        MyArmstrongNumber man = new MyArmstrongNumber();
        System.out.println("Is 371 Armstrong number? "+man.isArmstrongNumber(371));
        System.out.println("Is 523 Armstrong number? "+man.isArmstrongNumber(523));
        System.out.println("Is 153 Armstrong number? "+man.isArmstrongNumber(153));
    }
}

Output:
Is 371 Armstrong number? true
Is 523 Armstrong number? false
Is 153 Armstrong number? true