zoukankan      html  css  js  c++  java
  • 第十二周作业

    package Wxte;
    
    public class Best {
    
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    		   String str = "Hello World";
    	        char[] c = str.toCharArray();
    	        StringBuffer buffer = new StringBuffer();
    
    	        for (int b= str.length() - 1; b >= 0; b--) {
    	            if ((c[b] >= 'A') && (c[b] <= 'Z')) {
    	                buffer.append(String.valueOf(c[b]).toLowerCase());
    	         } else if ((c[b] >= 'a') && (c[b] <= 'z')) {
    	                buffer.append(String.valueOf(c[b]).toUpperCase());
    	        }
    	        }
    	        System.out.println(buffer.toString());
    }
    }
    

      

    package Wxte;
    import java.util.Random;
    public class Demmom {
    
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    	     Random rand = new Random();
    	        int[] num = new int[5];
    	        for (int a=0; a<num.length; a++) {
    	             num[a] = 20 + rand.nextInt(31);
    	             System.out.println(num[a]);
    	}
        }
    	}
    	
    

      

  • 相关阅读:
    链表基础操作2
    数据结构第二章课后作业
    CSAPP第二個實驗bomblab
    链表的基础操作1
    Codeforces 375
    Codeforces 372
    Codeforces 367
    线性同余方程组
    【除草】反演
    【转】组合数求模
  • 原文地址:https://www.cnblogs.com/575757ljp--/p/12970230.html
Copyright © 2011-2022 走看看