Skip to main content

Implementation of all methods of the String class in java


import java.io.*;
class strclass
{ public static void main(String args[])throws IOException
   { String str,s2;
      int ch,pos;
      DataInputStream in=new DataInputStream(System.in);
      while(true)
      {
      System.out.println("\n-------STRING CLASS--------\n");
      System.out.print("\n 1. To Upper Case");
      System.out.print("\n 2. To Lower Case");
      System.out.print("\n 3. Replace");
      System.out.print("\n 4. Trim");
      System.out.print("\n 5. Equals");
      System.out.print("\n 6. Equals Ignore Case");
      System.out.print("\n 7. Length");
      System.out.print("\n 8. Char At");
      System.out.print("\n 9. Compare To");
      System.out.print("\n 10. Concatenate");
      System.out.print("\n 11. Substring");
      System.out.print("\n 12. IndexOf");
      System.out.print("\n 0. EXIT");
      System.out.print("\n\n Enter your choice: ");
      ch=Integer.parseInt(in.readLine());
     

      switch(ch)
      { case 1: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    s2=str.toUpperCase();
                    System.out.print("\n\n Converted To Upper case: " + s2);
                    break;
         case 2: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    s2=str.toLowerCase();
                    System.out.print("\n\n Converted To Lower case: " + s2);
                    break;
         case 3: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    s2=str.replace('v','x');
                    System.out.print("\n\n Sting Replaced by 'x': " + s2);
                    break;
         case 4: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    s2=str.trim();
                    System.out.print("\n\n Trimmed String: " + s2);
                    break;
          case 5: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    System.out.print("\n\n Enter string: ");
                    s2=in.readLine();
                    if(str.equals(s2))
                     System.out.print("\n\n Strings are Equal: ");
                    else
                      System.out.print("\n\n Strings are not Equal: ");
                    break;
           case 6: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    System.out.print("\n\n Enter string: ");
                    s2=in.readLine();
                    if(str.equalsIgnoreCase(s2))
                     System.out.print("\n\n Strings are Equal: ");
                    else
                      System.out.print("\n\n Strings are not Equal: ");
                    break;
            case 7: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                   
                     System.out.print("\n\n Length: "+ str.length());
                    break;
            case 8: System.out.print("\n\n Enter string: ");
                     str=in.readLine();
                    System.out.print("\n\n Enter position: ");
                    pos=Integer.parseInt(in.readLine());
                     System.out.print("\n\n Length: "+ str.charAt(pos));
                     break;
           case 9: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    System.out.print("\n\n Enter string: ");
                    s2=in.readLine();
                    if(str.compareTo(s2)<0)
                     System.out.print("\n\n  " + str + " is  smaller than the " + s2);
                    else if(str.compareTo(s2)>0)
                      System.out.print("\n\n  " + str + " is  greater than the " + s2);
                    break;
             case 10: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    System.out.print("\n\n Enter string: ");
                    s2=in.readLine();
                   
                    System.out.print("\n\n  concatenated Strings is : " + str.concat(s2));
                    break;
              case 11: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                    System.out.print("\n\n Enter position: ");
                    pos=Integer.parseInt(in.readLine());
                   
                    System.out.print("\n\n  SubString is: " + str.substring(pos));
                    break;
             case 12: System.out.print("\n\n Enter string: ");
                    str=in.readLine();
                   
                    System.out.print("\n\n  Index of  'v'"+ " is " + str.indexOf('v'));
                    break;
             case 0: System.exit(1);
             default: System.out.print("\n invalid choice");
           }
     }
 }
}

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Occurrences of each letter of alphabet in the text

Program to print a table indicating the no. of occurrences of each letter of alphabet in the text entered as command line arguments. #include<iostream> #include<string> using namespace std; int main(int argc, char *argv[]) { string str=""; static int alphabet[26]; int x; cout<<"\n\n Command-Line Argument\n"; for(int i=0;i<argc;i++) { cout<<"\n "<<argv[i]; str+=argv[i]; } for(int i=0;i<str.length();i++) { if(str[i]>='A' && str[i]<='Z') { x=((int)str[i])-65; alphabet[x]++; } else if(str[i]>='a' && str[i]<='z') { x=((int)str[i])-97; alphabet[x]++; } } //Displaying No. of occurrences of each alphabets in the command line argument cout<<"\n\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n Alphabet No. of Occurrences\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"; for(int i=0;i<26;i++)...

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};...