zoukankan      html  css  js  c++  java
  • eg_1

    1. 编写一个程序,输出一个字符串中的大写英文字母个数,小写英文字母个数以及非英文字母个数.

      第一种方法:

    public class Test {
    	public static void main(String[] args) {
    		String s = "AaabbcceeeFgFhjklOIU9890454jiaQQqwq_!!!@09&&&haAA";
    		int Lcount = 0, Ucount = 0, Ocount = 0;
    		for(int i=0;i<s.length();i++){
    			if(s.charAt(i) >= 'a' && s.charAt(i) <= 'z'){
    				Lcount++;
    			}
    			else if(s.charAt(i) >= 'A' && s.charAt(i) <= 'Z'){
    				Ucount++;
    			}
    			else {
    				Ocount++;
    			}
    		}
    		System.out.println("Lcount: "+Lcount+","+"Ucount: "+Ucount+","+"Ocount: "+Ocount);
    	}
    } //Lcount: 22,Ucount: 10,Ocount: 17
    

      第二种方法:

    public class Test {
    	public static void main(String[] args) {
    		String s = "AaabbcceeeFgFhjklOIU9890454jiaQQqwq_!!!@09&&&haAA";
    		int Lcount = 0, Ucount = 0, Ocount = 0;
    		for(int i=0;i<s.length();i++){
    			if(Character.isLowerCase(s.charAt(i))){
    				Lcount++;
    			}
    			else if(Character.isUpperCase(s.charAt(i))){
    				Ucount++;
    			}
    			else {
    				Ocount++;
    			}
    		}
    		System.out.println("Lcount: "+Lcount+","+"Ucount: "+Ucount+","+"Ocount: "+Ocount);
    	}
    }// Lcount: 22,Ucount: 10,Ocount: 17
    

     第三种方法:

    public class Test {
    	public static void main(String[] args) {
    		String BL = "abcdefghijklmnopqrstuvwxyz";
    		String BU = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    		String s = "AaabbcceeeFgFhjklOIU9890454jiaQQqwq_!!!@09&&&haAA";
    		int Lcount = 0, Ucount = 0, Ocount = 0;
    		for(int i=0;i<s.length();i++){
    			if(BL.indexOf(s.charAt(i)) != -1){
    				Lcount++;
    			}
    			else if(BU.indexOf(s.charAt(i)) != -1){
    				Ucount++;
    			}
    			else {
    				Ocount++;
    			}
    		}
    		System.out.println("Lcount: "+Lcount+","+"Ucount: "+Ucount+","+"Ocount: "+Ocount);
    	}
    }// Lcount: 22,Ucount: 10,Ocount: 17
    
  • 相关阅读:
    概率面试题
    机器学习概率题总结(转载)
    筛素数以及判断数是否是素数
    腾讯2019正式批春笔试题
    推荐系统架构
    文本表示与匹配
    CTR预估经典模型总结
    spark运行原理
    leetcode 字符串动态规划总结
    无向图的邻接矩阵创建代码以及深度遍历广度遍历
  • 原文地址:https://www.cnblogs.com/bosongokay/p/6758906.html
Copyright © 2011-2022 走看看