一個(gè)java編程題，求高手寫(xiě)下程序，謝謝了
寫(xiě)一個(gè)JSP訪問(wèn)Access數(shù)據(jù)庫(kù)的user表，將所有的記錄顯示出來(lái)；ODBC數(shù)據(jù)源名為test，驅(qū)動(dòng)類(lèi)名為：”sun.jdbc.odbc.JdbcOdbcDriver”，連接數(shù)據(jù)庫(kù)的url為：”jdbc:odbc:test”。user表中name字段為文本類(lèi)型，password為數(shù)字類(lèi)型。rnrnname passwordrn張三 123rn李四 456rn王五 789Class.forName("sun.jdbc.odbc.JdbcOdbcDriver");
String url = "jdbc:odbc:test";
Connection con = DriverManager.getConnection(url, "root","root");
String sql = "select * from user";
PreparedStatement ps = con.prepareStatement(sql);
ResultSet rs = ps.executeQuery();
while(rs.next()){
System.out.println("name=" + rs.getInt(1)+". password=" + rs.getInt(2));
}
只是提示：
Collection conn = DiverManager.getCollection(url,user,password);
就是這些東西，懂了嗎？
樓上寫(xiě)得很好.....
求高手幫忙解決JAVA的幾道題目 跪謝~~~！！~~
1。下面是求階乘的遞歸算法，方法的返回值類(lèi)型為long, 請(qǐng)完成程序。rn________ Factorial(long n)rn{rnif(n<=1)rnreturn 1;rnelsern____________;rn}rn2。以下程序的輸出結(jié)果為 。rnpublic class WhileTest {rn public static void main(String args[]) {rn int i = 10;rn while (i-- > 0) {rn if (i % 2 == 0) {rn continue;rn }rn System.out.print(i + " ");rn }rn }rn}rn3。以下程序的輸出結(jié)果為 。rnclass Person {rn private String name;rn public Person() {rn this("陳敏");rn }rn public Person(String setName) {rn name = setName;rn }rn public String getName() {rn return name;rn }rn}rnclass Teacherrn extends Person {rn private String id;rn public Teacher(String s1, String s2) {rn super(s1);rn id = s2;rn }rn public String getId() {rn return id;rn }rn}rnpublic class Test {rn public static void main(String[] args) {rn Teacher t = new Teacher("黃牧", "000001");rn System.out.println(t.getName());rn System.out.println(t.getId());rn }rn}rn4。以下程序的輸出結(jié)果為 。 rninterface Runner { rn public abstract void run();rn}rnclass Dogrn implements Runner {rn public void run() {rn System.out.println("A dog is running.");rn }rn}rnclass Horsern implements Runner {rn public void run() {rn System.out.println("A horse is running.");rn }rn}rnpublic class Test {rn public static void run(Runner r) {rn r.run();rn }rn public static void main(String[] args) {rn Runner horse = new Dog();rn run(horse);rn }rn}rn5。編寫(xiě)一程序創(chuàng)建4個(gè)線(xiàn)程，分別顯示4個(gè)不同的整數(shù)，用繼承Thread類(lèi)以及實(shí)現(xiàn)Runnable接口的兩種方式實(shí)現(xiàn)。rnrnrnrn不一定都完成，能回答多少就回答多少吧。都回答了的我再加分。謝謝~~~~！~~~~1.
public long Factorial(long n)
{
if(n<=1)
return 1;
else
return Factorial(n-1)*n;
}
2.
9 7 5 3 1
3.
A dog is running.
4.
黃牧
000001
5.線(xiàn)程介紹 應(yīng)該都有的，自己找版找吧權(quán)
考試要靠平時(shí)積累，臨時(shí)找答案是不對(duì)的。------江西理工大學(xué) JAVA 井福榮
一道Java的題目 求編程
Problem Description:rnWrite a program that reads integers, findsthe largest of them, and counts its occurrences. Assume that the input endswith number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds thatthe largest is 5 and the occurrence count for 5 is 4. (Hint: Maintain twovariables, max and count. max stores the current max number, and count storesits occurrences. Initially, assign the first number to max and 1 to count.Compare each subsequent number with max. If the number is greater than max,assign it to max and reset count to 1. If the number is equal to max, incrementcount by 1.)rn rnHere are sample runs of the program:rn rnSample 1:rnEnternumbers: 3 5 2 5 5 5 0rnThelargest number is 5rnTheoccurrence count of the largest number is 4rn rnSample 2:rnEnternumbers: 3 6 5 4 2 4 5 4 55 0rnThelargest number is 6rnTheoccurrence count of the largest number is 1首先你讀懂題沒(méi)有，我?guī)湍惴g一下：
問(wèn)題描述：
編寫(xiě)一個(gè)程序，讀取整數(shù)，找出其中最大的，并計(jì)算其出現(xiàn)次數(shù)。假設(shè)輸入與數(shù)字0結(jié)束。假設(shè)你進(jìn)入3 5 2 5 5 5 0;程序發(fā)現(xiàn)，最大的為5，出現(xiàn)次數(shù)為4. （提示：建立兩個(gè)變量，最大值和計(jì)數(shù)值，最大存儲(chǔ)當(dāng)前的最大數(shù)量，并計(jì)算其出現(xiàn)次數(shù)，分配一個(gè)最大值和1來(lái)計(jì)算比較每個(gè)后續(xù)數(shù)，最大如果人數(shù)大于最大。 ，將其分配到最大，并重置計(jì)數(shù)為1，如果數(shù)等于最大，由1遞增計(jì)數(shù)。）
下面是該程序的運(yùn)行示例：
示例1：
輸入數(shù)字：3 5 2 5 5 5 0
最大數(shù)量為5
出現(xiàn)次數(shù)為4
示例2：
輸入數(shù)字：3 6 5 4 2 4 5 4 5 5 0
最大數(shù)是6
出現(xiàn)次數(shù)為1
簡(jiǎn)單的說(shuō)，問(wèn)題就是隨便輸入一串?dāng)?shù)字，找出最大值，并且計(jì)算其出現(xiàn)次數(shù)！
問(wèn)題搞清楚了，就來(lái)編程吧，經(jīng)測(cè)試，我的代碼可以正確運(yùn)行：
package test01;
import java.util.Scanner;
public class TestSystemIn {
public static void main(String[] args) {
System.out.println("請(qǐng)輸入內(nèi)容，不同內(nèi)容以逗號(hào)隔開(kāi)，請(qǐng)以0結(jié)尾,以回車(chē)結(jié)束");
Scanner scanner = new Scanner(System.in);
String str = scanner.next();
String a[] = str.split(",");
int temp = 0;
if (0 != (Integer.parseInt(a[a.length - 1]))) {
System.out.println("請(qǐng)以0結(jié)尾");
return;
}
for (int i = 0; i < a.length; i++) {
if (Integer.parseInt(a[i]) > temp) {
temp = Integer.parseInt(a[i]);
}
}
System.out.println("最大的為：" + temp);
int max = temp;
int times = 0;
for (int i = 0; i < a.length; i++) {
if (Integer.parseInt(a[i]) == max) {
times++;
}
}
System.out.println("出現(xiàn)的次數(shù)為：" + times);
}
}
給出代碼如下：
//get the max and occurance
public static void getMax() throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String input = reader.readLine();
if(input == null || input.trim().length() == 0){
System.out.println("your input occurs error!");
return ;
}
String[] arr = input.split(" ");
if(!arr[arr.length-1].trim().equals("0")) {
System.out.println("your input occurs error!");
return ;
}
int max = Integer.valueOf(arr[0]), occur = 1;
for(int i = 1, length = arr.length-1 ;i < length;i ++) {
if(Integer.valueOf(arr[i]) > max) {
max = Integer.valueOf(arr[i]);
occur = 1;
} else if ( Integer.valueOf(arr[i]) == max) {
occur ++;
}
}
System.out.println("The max num is "+ max +"; and the occurance is "+ occur);
}
調(diào)用代碼：
public static void main(String[] args) throws ParseException, IOException {
// TODO Auto-generated method stub
getMax();
}
樓主不懂，可以繼續(xù)追問(wèn)。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static int max = Integer.MIN_VALUE;
static int countOfMax = 0;
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String line;
while (true) {
System.out.print("Enter numbers: ");
line = reader.readLine();
String[] numbers = line.split(" ");
if (!"0".equals(numbers[numbers.length-1])) {
System.err.println("The input has to end with number 0");
System.out.println();
continue;
}
int[] numberArray = new int[numbers.length-1];
for (int i = 0; i < numbers.length-1; i++) {
numberArray[i] = Integer.parseInt(numbers[i]);
}
analyze(numberArray);
System.out.println("The largest number is " + max);
System.out.println("The occurrence count of the largest number is " + countOfMax);
System.out.println();
}
}
public static void analyze(int[] input) {
reset();
for (int num : input) {
if (num > max) {
max = num;
countOfMax = 1;
}
else if (num == max) {
countOfMax++;
}
}
}
public static void reset() {
max = Integer.MIN_VALUE;
countOfMax = 0;
}
}
一道java編程題目！
設(shè)計(jì)一個(gè)類(lèi)系，反映如圖所示各對(duì)象之間關(guān)系：r r
rr要求：r1.Area為抽象類(lèi)r2.反映出類(lèi)系之間的關(guān)系；r3.Area類(lèi)中只包含一個(gè)抽象方法：double area()r4.子類(lèi)RoundArea類(lèi)通過(guò)覆蓋父類(lèi)中的抽象方法area來(lái)求圓的面積，圓的半徑為該類(lèi)的唯一變量，double類(lèi)型r5.子類(lèi)RectArea類(lèi)通過(guò)覆蓋父類(lèi)中的抽象方法area來(lái)求長(zhǎng)方形的面積，長(zhǎng)方形的邊長(zhǎng)為該類(lèi)的兩個(gè)變量，double類(lèi)型rrr能解決的都試試?yán)玻嘀x！！public class AreaTest{
public static void main(String args[]){
RoundArea round=new RoundArea();
round.r=1.256;
System.out.println("圓1半徑為: "+String.valueOf(round.r));
System.out.println("圓1面積為: "+round.area());
System.out.println();
RectArea rect=new RectArea();
rect.width=1.25;
rect.height=2.56;
System.out.println("矩形1寬: "+String.valueOf(rect.width));
System.out.println("矩形1高: "+String.valueOf(rect.height));
System.out.println("矩形1面積: "+rect.area());
}
}
abstract class Area {
abstract double area();
}
class RoundArea extends Area {
double r;
double area() {
return 3.14159*r*r;
}
}
class RectArea extends Area {
double width;
double height;
double area() {
return width*height;
}
}
求問(wèn)一道java題目，麻煩寫(xiě)出下面詳細(xì)程序，在線(xiàn)等！
設(shè)計(jì)一個(gè)職員類(lèi)（Employee），包含成員變量：姓名（name），入職日期（hireday），月薪（salary），以及顯示職員信息（show）和計(jì)算年納稅額（tax）的方法。其中月納稅額計(jì)算：salary<=3000不計(jì)稅；3000public class Employee
{
protected String name;
protected String hireDay;
protected double salary;
public Employee(String name, String hireDay, double salary)
{
super();
this.name = name;
this.hireDay = hireDay;
this.salary = salary;
}
public void show(String type)
{
System.out.println("崗位：" + type);
System.out.println("姓名："+name+",入職日期："+hireDay+ ",月薪："+salary);
}
public double tax()
{
if (salary <= 3000)
return 0;
else if (salary <= 5000)
return (salary - 3000) * 0.05 * 12;
else if (salary <= 10000)
return (2000 * 0.05 + (salary - 5000) * 0.1) * 12;
else if (salary <= 15000)
return (2000 * 0.05 + 5000 * 0.1 + (salary - 10000) * 0.15) * 12;
else
return (2000 * 0.05 + 5000 * 0.1 + 5000 * 0.15 + (salary - 15000) * 0.2) * 12;
}
}
public class Manager extends Employee
{
private double bonus;
public Manager(String name, String hireDay, double salary, double bonus)
{
super(name, hireDay, salary);
this.name = name;
this.hireDay = hireDay;
this.salary = salary;
this.bonus = bonus;
}
public void show(String type)
{
System.out.println("崗位：" + type);
System.out.println("姓名："+name+",入職日期："+hireDay+ ",月薪："+salary+",獎(jiǎng)金：+"+bonus);
}
public double tax()
{
if(salary<=3000)
return bonus*0.2;
else if(salary<=5000)
return (salary-3000)*0.05*12+bonus*0.2;
else if(salary<=10000)
return (2000*0.05+(salary-5000)*0.1)*12+bonus*0.2;
else if(salary<=15000)
return (2000*0.05+5000*0.1+(salary-10000)*0.15)*12+bonus*0.2;
else
return (2000*0.05+5000*0.1+5000*0.15+(salary-15000)*0.2)*12+bonus*0.2;
}
}
好簡(jiǎn)單啊，確認(rèn)給分嗎
相關(guān)推薦：
商業(yè)秘密規(guī)定(中國(guó)商業(yè)秘密侵權(quán)罪立案標(biāo)準(zhǔn)規(guī)定)
域名爭(zhēng)議知識(shí)(域名爭(zhēng)議解決辦法)
鄰接權(quán)的概念(鄰接權(quán)是什么意思)
專(zhuān)利權(quán)人變更(公司更名后 如何變更專(zhuān)利權(quán)人)
專(zhuān)利糾紛訴訟(侵犯專(zhuān)利如何起訴要求賠償)