正文
Java实现权重计算代码 java加权平均
提示：扫一扫查出行【扫一扫了解最新限行尾号】
复制提示
如何在java代码中设置权重
editText.setLayoutParams(new LinearLayout.LayoutParams(width, height, weight)); 只有LinearLayout才有layout_weight属性。
相关问答
Q1: java实现最大权重单增序列
import java.util.Scanner;
public class Main {
public static int data[] = null;
public static int weight[] = null;
public static int res[] = null;
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println("输入序列个数：");
int n = 0;
n = scan.nextInt();
System.out.println("输入"+n+"个数（空格隔开）：");
data = new int[n];
for (int i = 0; i n; ++i) {
data[i] = scan.nextInt();
}
System.out.println("输入"+n+"个数的权重（空格隔开）：");
weight = new int[n];
for (int i = 0; i n; ++i) {
weight[i] = scan.nextInt();
}
doit(n);
int max = res[0];
int k = 0;
for (int i = 1; i n; ++i) {
if (max res[i]) {
max = res[i];
k = i;
}
}
System.out.println("最大权值："+max);
System.out.println("序列为：");
print(k);
System.out.println();
}
public static void doit(int n) {
res = new int[n];
for (int i = 0; i n; ++i) {
res[i] = weight[i];
for (int j = 0; j i; ++j) {
if (data[i] data[j] res[i] weight[i]+res[j]) {
res[i] = weight[i]+res[j];
}
}
}
}
public static void print(int k) {
for (int i = k-1; i = 0; --i) {
if (res[i]+weight[k] == res[k]) {
print(i);
}
}
System.out.print(" "+data[k]);
}
}
输入样例：
输入序列个数：
5
输入5个数（空格隔开）：
1 4 2 3 9
输入5个数的权重（空格隔开）：
1 10 1 1 1
输出样例
最大权值：12
序列为：
1 4 9
注：序列可能不唯一，就输出了一组
Q2: 设计一种java数据结构，按照权重进行排序
public enum SortBy {
Number,
Weights1,
Weights2
}
import java.util.Comparator;
public class MyComparator implements ComparatorStudent{
private SortBy sortBy;
public MyComparator (SortBy sortBy){
this.sortBy = sortBy;
}
@Override
public int compare(Student s1, Student s2) {
switch (this.sortBy) {
case Weights1:
return s1.getWeights1() - s2.getWeights1();
case Weights2:
return s1.getWeights2() - s2.getWeights2();
default:
return s1.getNumber() - s2.getNumber();
}
}
}
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
public class Student {
private int number;
private int weights1;
private int weights2;
public Student(int number, int weights1, int weights2) {
this.number = number;
this.weights1 = weights1;
this.weights2 = weights2;
}
public int getNumber() {
return this.number;
}
public int getWeights1() {
return this.weights1;
}
public int getWeights2() {
return this.weights2;
}
public static void main(String[] args){
final Student s1 = new Student(1, 20, 300);
final Student s2 = new Student(2, 10, 100);
final Student s3 = new Student(3, 30, 200);
final ListStudent array = new LinkedListStudent();
array.add(s1);
array.add(s2);
array.add(s3);
final ComparatorStudent numberComparator = new MyComparator(SortBy.Number);
Collections.sort(array, numberComparator);
System.out.println("sort by number");
System.out.print("Number: ");
for(Student s: array){
System.out.print(s.getNumber() + " ");
}
System.out.println("\n\n");
final ComparatorStudent weights1Comparator1 = new MyComparator(SortBy.Weights1);
System.out.println("sort by weights1");
System.out.print("Number: ");
Collections.sort(array, weights1Comparator1);
for(Student s: array){
System.out.print(s.getNumber() + " ");
}
System.out.println("\n\n");
final ComparatorStudent weights2Comparator = new MyComparator(SortBy.Weights2);
System.out.println("sort by weights2");
System.out.print("Number: ");
Collections.sort(array, weights2Comparator);
for(Student s: array){
System.out.print(s.getNumber() + " ");
}
System.out.println("\n\n");
}
}
sort by number
Number: 1 2 3
sort by weights1
Number: 2 1 3
sort by weights2
Number: 2 3 1
Q3: java随机数怎么做加权
class C9
{
static int i;
static void sui()
{
System.out.println("\n 排序前：");
float [] a=new float[30];
for(i=0;i30;i++)
{
a[i]=(float)(Math.random()*20);//获得30个随机数
System.out.print(" "+a[i]+" ");
if((i+1)%3==0)
System.out.println();
}
pai(a);
}
static void pai(float a[])
{
System.out.println("\n 排序后：");
for(i=0;i29;i++) //冒泡法排序
{
for(int j=0;j29-i;j++)
{
if(a[j]a[j+1])
{
float t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
for(i=0;i30;i++)
{
System.out.print(" "+a[i]+" ");
if((i+1)%3==0)
System.out.println();
}
suip(a); //把数组传给下个函数
}
static void suip(float a[]) //把函数打乱Java实现权重计算代码，
{
int k=1;
int l=0;
int d;
int [] b=new int[30];
float [] c=new float[30];
c[0]=a[0];
b[0]=(int)(Math.random()*30);
while(k30)
{
d=(int)(Math.random()*30); //随机一个30内整数给d
for(l=0;lk;l++)
{
if(b[l]==d) //d的数和数组里的数比较Java实现权重计算代码，若有重复，则退出for循环，返还上面重新给d赋值
break;
if(l==k-1) //把d里的数写进c数组
{
b[k]=d;
c[d]=a[k];
k++;
}
}
}
System.out.println("\n打乱后:");
for(i=0;i30;i++)
{
d=b[i]; //数组的值给c数组的下标，把a数组的值给c数组
c[d]=a[i];
System.out.print(" "+c[i]+" ");
if((i+1)%3==0)
System.out.println();
}
}
public static void main(String[] args)
{
sui();
}
}
Q4: java的权重匹配算法技术求教
网站权重其实是指百度
而百度权重就是指网站获取流量的能力.根据你网站获取流量的能力来划分权重等级.下面给出的就根据流量的多少来划分权重的数据.
百度预计流量1~99 权重1
百度预计流量100~499 权重2
百度预计流量500~999 权重3
百度预计流量1000~4999 权重4
百度预计流量5000~9999 权重5
百度预计流量10000~49999 权重6
百度预计流量50000~199999 权重7
百度预计流量200000~999999 权重8
百度预计流量1000000以上 权重9”
另外要说的 就是百度权重是第三方根据研究百度的出来的结论.百度自身是没有这个说法的.
Java实现权重计算代码的介绍就聊到这里吧，感谢你花时间阅读本站内容，更多关于java加权平均、Java实现权重计算代码的信息别忘了在本站进行查找喔。
