「javarank()」javarank net
本篇文章给大家谈谈javarank()，以及javarank net对应的知识点，希望对各位有所帮助，不要忘了收藏本站喔。
本文目录一览：
- 1、java投票排名实现
- 2、用java做题根据输入的分数,输出该成绩的等级(如优秀、良好、中、几个或不及格？
- 3、用java找出这几个list，所有可能的组合，并且组合结果的list中的数据不允许重复
- 4、java 数组求最小的三个值，并且考虑平手
- 5、急求用C++或者Java 实现求一个矩阵的秩 求源代码～
- 6、JAVA中随机生成各有13张扑克牌（每张牌从“A”到“K”）的两组，比较两组数对应位置上牌点数大小的程序？
java投票排名实现
两种实现方式：1）sql，2）java
1）sql语句-mysql
SELECT NAME,num,ranking
FROM (SELECT NAME,num,
IF (num =@num ,@ranking ,@ranking :=@ranking + 1)AS ranking,
@num := num
FROM score,
(SELECT @ranking := 0,@num:=-1) tmp
ORDER BY num DESC
)tmp
2) java实现
public static void main(String[] args) {
//初始化数据
ListRank ranks = Arrays.asList(new Rank("薛之谦", 100l),
new Rank("陈奕迅", 102l),
new Rank("田馥甄", 100l),
new Rank("周杰伦", 99l));
//按分数降序排序
ranks.sort((r1, r2) - r2.getNum().compareTo(r1.getNum()));
//计算排名
int ranking = 0;
long num = -1;
for (Rank rank : ranks) {
rank.setRanking(rank.getNum() == num ? ranking : ++ranking);
num = rank.getNum();
}
//输出
ranks.forEach(o - System.out.println(o.getName() + ";" + o.getNum() + ":" + o.getRanking()));
}
用java做题根据输入的分数,输出该成绩的等级(如优秀、良好、中、几个或不及格？
import java.util.Scanner;
public class DemoTest03 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入你的成绩，按回车键确定...");
int grade = sc.nextInt();
char rank;
/*
确定成绩的范围，具体到数据
*/
if(grade = 90) rank = 'S';
else if(grade = 80) rank = 'A';
else if(grade = 70) rank = 'B';
else if(grade = 60) rank = 'C';
else rank = 'D';
/*
switch不能判断表达式
在JDK1.5之前,switch循环只支持byte short char int四种数据类型.
JDK1.5 在switch循环中增加了枚举类与byte short char int的包装类------》对四个包装类的支持是因为java编译器
在底层手动进行拆箱,而对枚举类的支持是因为枚举类有一个ordinal方法,该方法实际上是一个int类型的数值.
JDK1.7在switch循环中增加了String类型-------》但实际上String类型有一个hashCode算法,结果也是int类型.
而byte short char类型可以在不损失精度的情况下向上转型成int类型.所以总的来说,可以认为switch中只支持int.
*/
switch (rank) {
case 'S' :
System.out.println("优秀");
break;
case 'A' :
System.out.println("中");
break;
case 'B' :
System.out.println("良好");
break;
case 'C' :
System.out.println("及格");
break;
case 'D' :
System.out.println("不及格");
break;
default :
System.out.println("系统错误，不存在的等级！");
break;
}
}
}
用java找出这几个list，所有可能的组合，并且组合结果的list中的数据不允许重复
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.TreeSet;
public class MyCode {
static TreeSetString ts = new TreeSet();
static StringBuffer stb = new StringBuffer();
public static void main(String args[]) {
ListInteger a = new ArrayList();
a.add(1);
a.add(2);
a.add(3);
ListInteger b = new ArrayList();
b.add(2);
b.add(3);
b.add(4);
b.add(5);
ListInteger c = new ArrayList();
c.add(5);
c.add(6);
ListInteger d = new ArrayList();
d.add(5);
ListInteger e = new ArrayList();
e.add(7);
String arr[];
ListString names = (Arrays.asList("a,b,c,d,e".split(",")));
ArrayListListInteger list = new ArrayList();
list.add(a);
list.add(b);
list.add(c);
list.add(d);
list.add(e);
for (int i = 0; i list.size(); i++) {
ListInteger temA = new ArrayList(list.get(i));
for (int j = i + 1; j list.size(); j++) {
ListInteger temB = new ArrayList(list.get(j));
temA.retainAll(temB);
if (temA.size() = 0) {
ListInteger temC = new ArrayList(list.get(i));
ListInteger temD = new ArrayList(list.get(j));
temC.addAll(temD);
stb.append(names.get(i) + "," + names.get(j) + ",");
getNameIndex(temC, list, i, j, names);
arr = stb.toString().split(",");
Arrays.sort(arr);
ts.add(Arrays.toString(arr));
stb.delete(0, stb.length());
}
}
}
for (IteratorString it = ts.iterator(); it.hasNext();) {
System.out.println(it.next());
}
}
private static void getNameIndex(ListInteger listTem, ListListInteger listB, int x, int y,
ListString names) {
for (int i = 0; i listB.size(); i++) {
if (i == x || i == y) {
continue;
}
ListInteger listN = new ArrayList(listTem);
ListInteger listM = new ArrayList(listB.get(i));
listN.retainAll(listM);
if (listN.size() = 0) {
stb.append(names.get(i));
break;
}
}
}
}
你这个,麻雀虽小,五脏俱全呢,看似一个简单的小玩意,挺费劲的!
主要用的是交集,并集,难点就是因为嵌套,有点饶头..你自己琢磨一下吧!
java 数组求最小的三个值，并且考虑平手
public static void main(String[] args) {
try {
InputStreamReader isr=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(isr);
int[] num1=new int[6];
int[] num2=new int[6];
String a;
for(int i=0; i 6; i++) {
System.out.println("请输入第" + (i + 1) + "个元素");
a=br.readLine();
num2[i]=Integer.parseInt(a);
num1[i]=Integer.parseInt(a);
}
StringBuilder result=new StringBuilder();
result.append("最小的是");
Arrays.sort(num1);
int rank=1;
int min=0;
int count=0;
for(int i=0; i 6 rank = 3; i++) {
if(min != num1[i] count=3) {
for(int k=0; k 6; k++) {
if(num1[i] == num2[k]) {
if(min != num2[k]) {
min=num2[k];
rank++;
}
result.append(k + 1).append("号,");
count++;
}
}
result.append("数值是：").append(num1[i]).append(";");
if(rank = 3 count=3) {
result.append("第").append(rank).append("小的是");
}
}
}
System.out.println(result);
} catch(IOException e) {
e.printStackTrace();
}
}
急求用C++或者Java 实现求一个矩阵的秩 求源代码～
把数据，也就是你每行每列展示的数据按规则存放到2维数组内。
然后按 行、列循环即可。但是前提，你存放的数据一定按照二维数组你想要的规则。String[i][j] array ; i为行、j为列。规则不能错误。
重点就是你如何往里塞数据。仔细考虑
JAVA中随机生成各有13张扑克牌（每张牌从“A”到“K”）的两组，比较两组数对应位置上牌点数大小的程序？
package card;
import java.util.Hashtable;
public class Card {
/**
* 0:方块 3：黑桃 4：王
*/
public static final int DIAMODE=0;
/**1：梅花*/
public static final int CLUB=1;
/**2:红桃*/
public static final int HEART=2;
/**3:黑桃*/
public static final int SPADE=3;
/**4:王*/
static final int WANG=4;
/**0:方块 3：黑桃 4：王*/
private static String[] SUIT_NAMES=new String[]{"方块","梅花","红桃","黑桃","王"};
public static final int THREE=0;
public static final int FOUR=1;
public static final int FIVE=2;
public static final int SIX=3;
public static final int SEVEN=4;
public static final int EIGHT=5;
public static final int NINE=6;
public static final int TEN=7;
public static final int JACK=8;
public static final int QUEEN=9;
public static final int KING=10;
public static final int ACE=11;
public static final int DUCK=12;
public static final int BALCK=13;
public static final int COLOR=14;
public static String[] RANK_NAMES=new String[]{"3","4","5","6","7"
,"8","9","10","J","Q","K","A","2","小","大"};
private int suit,rank;
// private static class Entry{
// private String name;
// private int value;
// public Entry(String name,int value) {
// this.name=name;
// this.value=value;
// }
// public int getValue() {
// return value;
// }
// public void setValue(int value) {
// this.value = value;
// }
// @SuppressWarnings("unused")
// public String getName() {
// return name;
// }
// @SuppressWarnings("unused")
// public void setName(String name) {
// this.name = name;
// }
// }
//public static Entry[] table = new Entry[120];
static HashtableString, Integer table = new HashtableString,Integer();
static{
for (int i = 0; i SUIT_NAMES.length; i++) {
// Entry entry = new Entry(SUIT_NAMES[i],i);
// table[SUIT_NAMES[i].hashCode()%120]=entry;
table.put(SUIT_NAMES[i], i);
}
for (int i = 0; i RANK_NAMES.length; i++) {
//Entry entry = new Entry(RANK_NAMES[i],i);
//table[RANK_NAMES[i].hashCode()%120]=entry;
table.put(RANK_NAMES[i], i);
}
}
public int getSuit() {
return suit;
}
public void setSuit(int suit) {
this.suit = suit;
}
public int getRank() {
return rank;
}
public void setRank(int rank) {
this.rank = rank;
}
public Card(int suit,int rank) {
setSuit(suit);
setRank(rank);
}
public Card(String strName){
String suitName;
String rankName;
if(strName.endsWith("王")){
suitName=strName.substring(1);
rankName=strName.substring(0,1);
}else{
suitName=strName.substring(0,2);
rankName=strName.substring(2);
}
setSuit(findSuit(suitName));
setRank(findRank(rankName));
}
private int findSuit(String suitName) {
//return table[suitName.hashCode()%120].getValue();
return table.get(suitName);
}
private int findRank(String rankName) {
return table.get(rankName);
}
@Override
public String toString() {
if(suit==Card.WANG)
return RANK_NAMES[rank]+SUIT_NAMES[suit];
return SUIT_NAMES[suit]+RANK_NAMES[rank];
}
@Override
public boolean equals(Object obj) {
if(obj==null)
return false;
if(obj==this)
return true;
if(obj instanceof Card){
Card other=(Card)obj;
return other.rank==rank other.suit==suit;
}
return false;
}
@Override
public int hashCode() {
return rank*10+suit;
}
}
/*************************************************************************************/
package card;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
public class CardDemo {
/**
* @param args
*/
public static void main(String[] args) {
// Card c=new Card(Card.HEART,Card.THREE);
// System.out.println(c.toString());
// c=new Card("黑桃A");
// System.out.println(c.toString());
ListCard cards = new ArrayListCard();
for (int i = 0; i = Card.DUCK; i++) {
for (int j = 0; j = Card.SPADE; j++) {
cards.add(new Card(j, i));
}
}
cards.add(new Card("小王"));
cards.add(new Card("大王"));
// Random r = new Random();
// for (int i =1; i cards.size(); i++) {
// int j=r.nextInt(i);
// Card temp=cards.get(i);
// cards.set(i, cards.get(j));
// cards.set(j, temp);
// }
Collections.shuffle(cards);
System.out.println(cards.toString());
Player[] players = new Player[3];
players[0] = new Player(0, "萧炎");
players[1] = new Player(1, "罗峰");
players[2] = new Player(2, "小胖");
// for (int i = 0; i cards.size();i++) {
// players[i%players.length].add(cards.get(i));
// }
// for (int i = 0; i players.length; i++) {
// System.out.println(players[i].toString());
// }
IteratorCard ite = cards.iterator();
int c=0;
while(ite.hasNext()){
players[(c++)%players.length].add(ite.next());
ite.remove();
}
for (int i = 0; i players.length; i++) {
System.out.println(players[i]);
}
}
}
javarank()的介绍就聊到这里吧，感谢你花时间阅读本站内容，更多关于javarank net、javarank()的信息别忘了在本站进行查找喔。