Watch dongmingchao/小区物业管理系统-课程设计

介绍文档 ->>

Watch 心轻草亦香/java 有理数 week 3

package other; //学号：201621123009 马玉兰 import java.util.Scanner; class Rational{ private int v1; //有理数的定义 private int v2; public Rational(){ } public Rational(int v1,int v2){ this.v1 = v1; this.v2 = v2; } //初始化有理数分子和分母 public int Gcd(int m,int n){ //求两个数的最大公约数 int t; while(m%n!=0) { t=n; n=m%n; m=t; } return n; } public String Minus(Rational a1,Rational a2){ //有理数相减 int t; Rational a3 = new Rational(); a3.v2 = a1.v2*a2.v2; a3.v1 = a1.v1*

Watch 心轻草亦香/java week 13 网络

public class ShoppingCart { //购物车 //key：商品编号 value:商品条目 private Map<Integer,ProductItem> map=new LinkedHashMap<Integer,ProductItem>(); public void addProduct(Product p){//添加商品 int productId=p.getProductId(); if(map.containsKey(productId)){ ProductItem productItem=map.get(productId); productItem.setCount(productItem.getCount()+1); }else{ map.put(productId, new ProductItem(

Watch 心轻草亦香/week 11 java 多线程

Watch 心轻草亦香/java week10 异常

Watch 心轻草亦香/java 泛型 ---week8

# include<stdio.h> int main() { int n,i,k; scanf("%d", &n); for ( i = 0; i < n; i++) { if (n - 1 - 2 * i >= 0) { for ( k = 0; k < n - 1 - 2 * i; k++) putchar(' '); for ( k = 0; k < 1 + 2 * i; k++) printf("* "); } else { for (k = 0; k > n - 1 - 2 * i; k--) putchar(' '); for (k = 0; k < 2*n-1-2*i; k++) printf("* "); } putchar('\n'); } return 0; }

Watch 心轻草亦香/java

# include<stdio.h> int main() { int n,i,k; scanf("%d", &n); for ( i = 0; i < n; i++) { if (n - 1 - 2 * i >= 0) { for ( k = 0; k < n - 1 - 2 * i; k++) putchar(' '); for ( k = 0; k < 1 + 2 * i; k++) printf("* "); } else { for (k = 0; k > n - 1 - 2 * i; k--) putchar(' '); for (k = 0; k < 2*n-1-2*i; k++) printf("* "); } putchar('\n'); } return 0; }

Watch 心轻草亦香/week 8---java

# include<stdio.h> int main() { int n,i,k; scanf("%d", &n); for ( i = 0; i < n; i++) { if (n - 1 - 2 * i >= 0) { for ( k = 0; k < n - 1 - 2 * i; k++) putchar(' '); for ( k = 0; k < 1 + 2 * i; k++) printf("* "); } else { for (k = 0; k > n - 1 - 2 * i; k--) putchar(' '); for (k = 0; k < 2*n-1-2*i; k++) printf("* "); } putchar('\n'); } return 0; }

Watch 心轻草亦香/week 8---java-集合

# include<stdio.h> int main() { int n,i,k; scanf("%d", &n); for ( i = 0; i < n; i++) { if (n - 1 - 2 * i >= 0) { for ( k = 0; k < n - 1 - 2 * i; k++) putchar(' '); for ( k = 0; k < 1 + 2 * i; k++) printf("* "); } else { for (k = 0; k > n - 1 - 2 * i; k--) putchar(' '); for (k = 0; k < 2*n-1-2*i; k++) printf("* "); } putchar('\n'); } return 0; }

Watch 心轻草亦香/week 7 java-图形界面

public class { private String name; public String toString(){ return "Fruit [name-" + name + "]" +"\n" +super.toString(); } public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((name == null) ? 0 : name.hashCode()); return result; } public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (getClass() != obj.getClass()) return false; Fruit other = (Fruit) obj; if (name == null) { -- 编辑