Code zu sagen, ob ein string ist ein Pangram oder nicht?

May be program by using set will make solution easier ..:)


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class Pangram {

public static void main(String args[]) {

    try {
        final String str;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        str = br.readLine().toLowerCase().replaceAll(" ", "");

        char[] chars = str.toCharArray();
        final Set set = new HashSet();

        for(char c: chars){
            set.add(c);
        }

        System.out.println(set.size());
        if(set.size() == 26)
           System.out.println("pangram");
        else
            System.out.println("not pangram");

    } catch (Exception e) {
        e.printStackTrace();
    }

}

}

Einen anderen, Ähnlichen Lösung für Ihr problem.

 public class PangramExample {  

      public static void main(String[] args) {  
           String s = "The quick brown fox jumps over the lazy dog";  
           System.out.println("Is given String Pangram ? : "  
                     + isPangramString(s.toLowerCase()));  
      }  
      private static boolean isPangramString(String s) {  
           if (s.length() < 26)  
                return false;  
           else {  
                for (char ch = 'a'; ch <= 'z'; ch++) {  
                     if (s.indexOf(ch) < 0) {  
                          return false;  
                     }  
                }  
           }  
           return true;  
      }  
 }  

Referenz , siehe diesen link http://techno-terminal.blogspot.in/2015/11/java-program-to-check-if-given-string.html

Dieses Problem beheben sollte:

import java.io.*;        
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

        public static boolean isPangram(String test){
            for (char a = 'A'; a <= 'Z'; a++)
                if ((test.indexOf(a) < 0) && (test.indexOf((char)(a + 32)) < 0))
                    return false;
            return true;
        }

        public static void main(String[] args)throws IOException {
            /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
           BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            String test=br.readLine();
            if(isPangram(test.toUpperCase())){

                System.out.println("pangram");

            }if(isPangram(test.toUpperCase())==false){

                System.out.println("not pangram");

            }
        }
    }

import java.util.Scanner;

public class Pangram {

    public static void main(String[] args) {
    int count=0;//Initialize counter to zero
    char[] arr = new char[26];//Character array of 26 size as there are 26 alphabets
    Scanner sc = new Scanner(System.in);
    String s = sc.nextLine();

    for(int i= 0; i<s.length();i++)
    {
        if(s.charAt(i)>=65 && s.charAt(i)<=90)//Ascii value of A to Z(caps)
        {
            if(arr[s.charAt(i)-65]==0)
            {
                count++;
                arr[s.charAt(i)-65]=1;
            }   
        }

        if(s.charAt(i)>=97 && s.charAt(i)<=122)//Ascii value of a to z
        {
            if(arr[s.charAt(i)-97]==0)
            {
                count++;
                arr[s.charAt(i)-97]=1;
            }

        }
    }

    System.out.println(count);

    if(count==26)
    {
        System.out.println("Pangram");
    }
    else
        System.out.println("not Pangram");
    }

}

Anderen Ansatz, dies zu tun

public boolean isPanGram(String arg)
{
    String temp = arg.toLowerCase().replaceAll(" ", "");

    String str = String.valueOf(temp.toCharArray());
    String[] array = str.split("");
    Set<String> tempSet = new TreeSet(Arrays.asList(array));
    if(tempSet.size()==26)
    {
        List loopList = new ArrayList();
        loopList.addAll(tempSet);
        if(loopList.get(0).equals("a") && loopList.get(25).equals("z"))
            return true;
    }

return false;   
}

Anderen einfachen Programm mit HashSet collection.

import java.util.HashSet;

public class Panagram {

    public static void main(String[] args) {
        pangrams("qmExzBIJmdELxyOFWv LOCmefk TwPhargKSPEqSxzveiun");
    }

    static String pangrams(String s) {

        String inputString = s.toLowerCase();

        HashSet<String> toRemoveDuplicates = new HashSet<String>();
        for (String eachAlphabet : inputString.split("")) {
            toRemoveDuplicates.add(eachAlphabet);
        }

        //Total alphabets are 26 + one space, so 27.
        if (toRemoveDuplicates.size() == 27) 
            return "panagram";
         else 
            return "not panagram";
    }
}

public class Panagram 
{
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        System.out.println("enter string ");
        String s = sc.nextLine();
        System.out.println("given string is :"+"\n" +s);
        String st=removeSpace(s);

       int d = check(st);
        if(d == -1)
            System.out.print(s+"\n" + "is not pangram");
        else
             System.out.print(s+"\n" +"is a pangram");

    }
    public static String removeSpace(String s) 
    {
        char ch[]=s.toCharArray();
        String nstr="";
        for (int i = 0; i < s.length(); i++) 
        {
            if (ch[i]!=' ') 
            {
                nstr=nstr + ch[i];
            }
        }

   return nstr;
    }

    public  static int check(String st)
    {

         int n = 26; 

        if(s.length() < n){
           return -1;   }

        for(char i = 'A'; i <= 'Z' ; i++){
            if((st.indexOf(i) < 0) && (st.indexOf((char)(i + 32)) < 0))