Java语言程序设计与数据结构(基础篇)课后练习题 第六章(二)

【一线大厂Java面试题解析+后端开发学习笔记+最新架构讲解视频+实战项目源码讲义】

**开源地址:https://docs.qq.com/doc/DSmxTbFJ1cmN1R2dB **

System.out.println(“Valid password.”);

else

System.out.println(“Invalid password.”);

}

public static boolean isValid(String str1){

int len = str1.length();

int count = 0;

if(len<8)

return false;

for(int i=0;i<len;i++){

char tmp = str1.charAt(i);

if((tmp>=‘a’&&tmp<=‘z’)||(tmp>=‘A’&&tmp<=‘Z’)||(tmp>=‘0’&&tmp<=‘9’)){

}else

return false;

}

for(int i=0;i<len;i++){

char tmp = str1.charAt(i);

if(tmp>=‘0’||tmp<=‘9’)

count++;

}

return count >=2;

}

}

6.19

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args)

{

Scanner input=new Scanner(System.in);

System.out.print("Enter three sides: ");

double s1=input.nextDouble();

double s2=input.nextDouble();

double s3=input.nextDouble();

if(isValid(s1,s2,s3))

System.out.println("The area is "+area(s1,s2,s3));

else

System.out.println(“The input is invalid.”);

}

public static boolean isValid(double side1,double side2,double side3){

return !(side1 >= side2 + side3) && !(side2 >= side1 + side3) && !(side3 >= side1 + side2);

}

public static double area(double side1,double side2,double side3){

double p=(side1+side2+side3)/2.0;double area = Math.sqrt(p*(p-side1)(p-side2)(p-side3));

return area;

}

}

6.20

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args)

{

Scanner input=new Scanner(System.in);

System.out.print("Enter a string: ");

String str = input.next();

System.out.println(str+" has “+countLetters(str)+” letters.");

}

public static int countLetters(String s){

int len = s.length();

s=s.toLowerCase(); //统一成小写字母。

int count = 0;

for(int i=0;i<len;i++){

if(s.charAt(i)>=‘a’&&s.charAt(i)<=‘z’)

count++;

}

return count;

}

}

6.21

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args)

{

Scanner input=new Scanner(System.in);

System.out.print("Enter a string: ");

String str = input.next();

int len = str.length();

str=str.toUpperCase(); //转化为大写字母

for(int i=0;i<len;i++)

{

if(str.charAt(i)<=‘Z’&&str.charAt(i)>=‘A’)

System.out.print(getNumber(str.charAt(i)));

else

System.out.print(str.charAt(i));

}

System.out.print(‘\n’);

}

public static int getNumber(char uppercaseLetter)

{

if(uppercaseLetter==‘A’||uppercaseLetter==‘B’||uppercaseLetter==‘C’)

return 2;

else if(uppercaseLetter==‘D’||uppercaseLetter==‘E’||uppercaseLetter==‘F’)

return 3;

else if(uppercaseLetter==‘G’||uppercaseLetter==‘H’||uppercaseLetter==‘I’)

return 4;

else if(uppercaseLetter==‘J’||uppercaseLetter==‘K’||uppercaseLetter==‘L’)

return 5;

else if(uppercaseLetter==‘M’||uppercaseLetter==‘N’||uppercaseLetter==‘O’)

return 6;

else if(uppercaseLetter==‘P’||uppercaseLetter==‘Q’||uppercaseLetter==‘R’||uppercaseLetter==‘S’)

return 7;

else if(uppercaseLetter==‘T’||uppercaseLetter==‘U’||uppercaseLetter==‘V’)

return 8;

else

return 9;

}

}

6.22

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args){

Scanner input=new Scanner(System.in);

System.out.print("Enter a integer: ");

long num = input.nextLong();

System.out.println("The root is "+sqrt(num));

}

public static double sqrt(long n){

double lastGuess = 1.0;

double nextGuess = (lastGuess+n/lastGuess)/2;

while(Math.abs(lastGuess-nextGuess)>0.0001){

lastGuess=nextGuess;

nextGuess=(nextGuess+n/nextGuess)/2;

}

return nextGuess;

}

}

6.23

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args){

Scanner input=new Scanner(System.in);

System.out.print("Enter a string: ");

String str = input.next();

System.out.print("Enter a char: ");

char c = input.next().charAt(0);

System.out.println("The number of “+c+” in “+str+” is "+count(str,c));

}

public static int count(String str,char a){

int count = 0;

for(int i=0;i<str.length()-1;i++){

if(str.charAt(i)==a)

count++;

}

return count;

}

}

6.24

=================================================================

package demo;

import java.util.Scanner;

public class diliuzhang {

public static void main(String[] args) {

// System.currentTimeMillis()方法做时间戳

long totalMilliseconds = System.currentTimeMillis();

  • 3
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值