「创意java题目」java毕业设计新颖题目

本篇文章给大家谈谈创意java题目，以及java毕业设计新颖题目对应的知识点，希望对各位有所帮助，不要忘了收藏本站喔。

本文目录一览：

• 1、java 小题目
• 2、JAVA编程题目，共四题，做其中一题就够了，
• 3、有关java编程题目？
• 4、简单的java小题目，求帮助
• 5、找个java毕业设计题目 web方面的，要新颖 实用

java 小题目

package util;

import java.util.Collection;

import java.util.Comparator;

import java.util.Iterator;

import java.util.List;

import java.util.ListIterator;

import java.util.Map;

import java.util.Set;

import java.util.SortedMap;

import java.util.SortedSet;

import java.util.concurrent.locks.Lock;

import java.util.concurrent.locks.ReadWriteLock;

import java.util.concurrent.locks.ReentrantReadWriteLock;

/**

* p

* 操作集合的类，可以返回以读写锁实现的各类集合br

* /p

*

*/

public class CollectionUtils {

private CollectionUtils() {}

/**

* p

* 返回用读写锁实现的集合

* /p

*

* @param collection

* 基础集合

* @return 同步集合

*/

public static T CollectionT readWriteLockCollection(

CollectionT collection) {

return new ReadWriteLockCollectionT(collection);

}

/**

* p

* 返回用读写锁实现的List

* /p

*

* @param list

* 基础List

* @return 同步List

*/

public static T ListT readWriteLockList(ListT list) {

return new ReadWriteLockListT(list);

}

/**

* p

* 返回用读写锁实现的Set

* /p

*

* @param set

* 基础Set

* @return 同步Set

*/

public static T SetT readWriteLockSet(SetT set) {

return new ReadWriteLockSetT(set);

}

/**

* p

* 返回用读写锁实现的SortedSet

* /p

*

* @param sortedSet

* 基础SortedSet

* @return 同步SortedSet

*/

public static T SortedSetT readWriteLockSortedSet(SortedSetT sortedSet) {

return new ReadWriteLockSortedSetT(sortedSet);

}

/**

* p

* 返回用读写锁实现的Map

* /p

*

* @param map

* 基础Map

* @return 同步Map

*/

public static K, V MapK, V readWriteLockMap(MapK, V map) {

return new ReadWriteLockMapK, V(map);

}

/**

* p

* 返回用读写锁实现的SortedMap

* /p

*

* @param sortedMap

* 基础SortedMap

* @return 同步SortedMap

*/

public static K, V SortedMapK, V readWriteLockSortedMap(

SortedMapK, V sortedMap) {

return new ReadWriteLockSortedMapK, V(sortedMap);

}

private static class ReadWriteLockCollectionT implements CollectionT {

private CollectionT collection;

protected ReadWriteLock lock = new ReentrantReadWriteLock();

private ReadWriteLockCollection(CollectionT collection) {

if (collection == null)

throw new NullPointerException();

this.collection = collection;

}

@Override

public boolean add(T e) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return collection.add(e);

} finally {

lock.unlock();

}

}

@Override

public boolean addAll(Collection? extends T c) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return collection.addAll(c);

} finally {

lock.unlock();

}

}

@Override

public void clear() {

Lock lock = this.lock.writeLock();

lock.lock();

try {

collection.clear();

} finally {

lock.unlock();

}

}

@Override

public boolean contains(Object o) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.contains(o);

} finally {

lock.unlock();

}

}

@Override

public boolean containsAll(Collection? c) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.containsAll(c);

} finally {

lock.unlock();

}

}

@Override

public boolean isEmpty() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.isEmpty();

} finally {

lock.unlock();

}

}

@Override

public IteratorT iterator() {

return collection.iterator();

}

@Override

public boolean remove(Object o) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return collection.remove(o);

} finally {

lock.unlock();

}

}

@Override

public boolean removeAll(Collection? c) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return collection.removeAll(c);

} finally {

lock.unlock();

}

}

@Override

public boolean retainAll(Collection? c) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return collection.retainAll(c);

} finally {

lock.unlock();

}

}

@Override

public int size() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.size();

} finally {

lock.unlock();

}

}

@Override

public Object[] toArray() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.toArray();

} finally {

lock.unlock();

}

}

@Override

public E E[] toArray(E[] a) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return collection.toArray(a);

} finally {

lock.unlock();

}

}

}

private static class ReadWriteLockListT extends

ReadWriteLockCollectionT implements ListT {

private ListT list;

private ReadWriteLockList(ListT list) {

super(list);

this.list = list;

}

@Override

public void add(int index, T element) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

list.add(index, element);

} finally {

lock.unlock();

}

}

@Override

public boolean addAll(int index, Collection? extends T c) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return list.addAll(index, c);

} finally {

lock.unlock();

}

}

@Override

public T get(int index) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return list.get(index);

} finally {

lock.unlock();

}

}

@Override

public int indexOf(Object o) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return list.indexOf(o);

} finally {

lock.unlock();

}

}

@Override

public int lastIndexOf(Object o) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return list.lastIndexOf(o);

} finally {

lock.unlock();

}

}

@Override

public ListIteratorT listIterator() {

return list.listIterator();

}

@Override

public ListIteratorT listIterator(int index) {

return list.listIterator(index);

}

@Override

public T remove(int index) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return list.remove(index);

} finally {

lock.unlock();

}

}

@Override

public T set(int index, T element) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return list.set(index, element);

} finally {

lock.unlock();

}

}

@Override

public ListT subList(int fromIndex, int toIndex) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockListT(

list.subList(fromIndex, toIndex));

} finally {

lock.unlock();

}

}

}

private static class ReadWriteLockSetT extends ReadWriteLockCollectionT

implements SetT {

private ReadWriteLockSet(SetT set) {

super(set);

}

}

private static class ReadWriteLockSortedSetT extends ReadWriteLockSetT

implements SortedSetT {

private SortedSetT sortedSet;

private ReadWriteLockSortedSet(SortedSetT sortedSet) {

super(sortedSet);

this.sortedSet = sortedSet;

}

@Override

public Comparator? super T comparator() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedSet.comparator();

} finally {

lock.unlock();

}

}

@Override

public T first() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedSet.first();

} finally {

lock.unlock();

}

}

@Override

public SortedSetT headSet(T toElement) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedSetT(

sortedSet.headSet(toElement));

} finally {

lock.unlock();

}

}

@Override

public T last() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedSet.last();

} finally {

lock.unlock();

}

}

@Override

public SortedSetT subSet(T fromElement, T toElement) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedSetT(sortedSet.subSet(

fromElement, toElement));

} finally {

lock.unlock();

}

}

@Override

public SortedSetT tailSet(T fromElement) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedSetT(

sortedSet.tailSet(fromElement));

} finally {

lock.unlock();

}

}

}

private static class ReadWriteLockMapK, V implements MapK, V {

private MapK, V map;

protected ReadWriteLock lock = new ReentrantReadWriteLock();

private ReadWriteLockMap(MapK, V map) {

if (map == null)

throw new NullPointerException();

this.map = map;

}

@Override

public void clear() {

Lock lock = this.lock.writeLock();

lock.lock();

try {

map.clear();

} finally {

lock.unlock();

}

}

@Override

public boolean containsKey(Object key) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return map.containsKey(key);

} finally {

lock.unlock();

}

}

@Override

public boolean containsValue(Object value) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return map.containsValue(value);

} finally {

lock.unlock();

}

}

@Override

public Setjava.util.Map.EntryK, V entrySet() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSetjava.util.Map.EntryK, V(

map.entrySet());

} finally {

lock.unlock();

}

}

@Override

public V get(Object key) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return map.get(key);

} finally {

lock.unlock();

}

}

@Override

public boolean isEmpty() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return map.isEmpty();

} finally {

lock.unlock();

}

}

@Override

public SetK keySet() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSetK(map.keySet());

} finally {

lock.unlock();

}

}

@Override

public V put(K key, V value) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return map.put(key, value);

} finally {

lock.unlock();

}

}

@Override

public void putAll(Map? extends K, ? extends V m) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

map.putAll(m);

} finally {

lock.unlock();

}

}

@Override

public V remove(Object key) {

Lock lock = this.lock.writeLock();

lock.lock();

try {

return map.remove(key);

} finally {

lock.unlock();

}

}

@Override

public int size() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return map.size();

} finally {

lock.unlock();

}

}

@Override

public CollectionV values() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockCollectionV(map.values());

} finally {

lock.unlock();

}

}

}

private static class ReadWriteLockSortedMapK, V extends

ReadWriteLockMapK, V implements SortedMapK, V {

private SortedMapK, V sortedMap;

private ReadWriteLockSortedMap(SortedMapK, V sortedMap) {

super(sortedMap);

this.sortedMap = sortedMap;

}

@Override

public Comparator? super K comparator() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedMap.comparator();

} finally {

lock.unlock();

}

}

@Override

public K firstKey() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedMap.firstKey();

} finally {

lock.unlock();

}

}

@Override

public SortedMapK, V headMap(K toKey) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedMapK, V(

sortedMap.headMap(toKey));

} finally {

lock.unlock();

}

}

@Override

public K lastKey() {

Lock lock = this.lock.readLock();

lock.lock();

try {

return sortedMap.lastKey();

} finally {

lock.unlock();

}

}

@Override

public SortedMapK, V subMap(K fromKey, K toKey) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedMapK, V(sortedMap.subMap(

fromKey, toKey));

} finally {

lock.unlock();

}

}

@Override

public SortedMapK, V tailMap(K fromKey) {

Lock lock = this.lock.readLock();

lock.lock();

try {

return new ReadWriteLockSortedMapK, V(

sortedMap.tailMap(fromKey));

} finally {

lock.unlock();

}

}

}

}

JAVA编程题目，共四题，做其中一题就够了，

好了，你测试一下咯!

public interface ShapeArea {//定义ShapeArea接口

public double getArea();//double getArea( ):求一个形状的面积

public double getPerimeter();// Double getPerimeter( ):求一个形状的周长。

}

public class MyTriangle implements ShapeArea {

double x,y,z,s;//x,y,z ：double型，表示三角形的三条边

public MyTriangle(double x, double y, double z) {//方法:MyTriangle(double x, double y, double z):构造函数，给三条边和s赋值；

this.x = x;

this.y = y;

this.z = z;

this.s = (x+y+z)/2;

}

@Override

public double getArea() {

return Math.sqrt(this.s*(this.s-this.x)*(this.s-this.y)*(this.s-this.z));

}

@Override

public double getPerimeter() {

return (x+y+z);

}

@Override

public String toString() {

System.out.print("此三角形的面积和周长为：");

return this.getArea()+"、"+this.getPerimeter();

}

}

public class Test {//测试类

public static void main(String[] args) {

MyTriangle myTriangle = new MyTriangle(3, 4, 5);

System.out.println(myTriangle);

}

}

有关java编程题目？

按照题目要求编写的圆,圆锥和测试类的Java程序如下

Test.java文件内容如下

class Circle{

private double r;

private String color;

public Circle(double r){

this.r=r;

}

public double area(){

return Math.PI*r*r;

}

public double perimeter(){

return Math.PI*2*r;

}

public double getR(){

return this.r;

}

public void setR(double r){

this.r=r;

}

public String getColor(){

return this.color;

}

public void setColor(String color){

this.color=color;

}

public String toString(){

return "圆的半径为"+r+",颜色为"+color;

}

}

class Cone{

private Circle c;

private double h;

private String color;

public Cone(Circle c,double h){

this.c=c;

this.h=h;

}

public double volume(){

return 1.0/3*c.area()*h;

}

public Circle getCircle(){

return this.c;

}

public void setCircle(Circle c){

this.c=c;

}

public double getH(){

return this.h;

}

public void setH(double h){

this.h=h;

}

public String getColor(){

return this.color;

}

public void setColor(String color){

this.color=color;

}

public String toString(){

return "圆锥的底面积为"+c.area()+",高为"+h+",颜色为"+color;

}

}

public class Test{

public static void main(String[] args){

Circle circle1=new Circle(2.5);

circle1.setColor("红色");

System.out.println(circle1.toString());

System.out.println("圆的面积为"+circle1.area());

System.out.println("圆的周长为"+circle1.perimeter());

Cone circlar1=new Cone(circle1,2.7);

circlar1.setColor("蓝色");

System.out.println(circlar1.toString());

System.out.println("圆锥的体积为"+circlar1.volume());

}

}

简单的java小题目，求帮助

1、People类

public class People {

private int id = 0;//序号

private int age;//单位岁

private int height;//单位cm

private double weight;//单位斤

private static int num = 0;

public int getId() {

return id;

}

public void setId(int id) {

this.id = id;

}

public int getAge() {

return age;

}

public void setAge(int age) {

this.age = age;

}

public int getHeight() {

return height;

}

public void setHeight(int height) {

this.height = height;

}

public double getWeight() {

return weight;

}

public void setWeight(double weight) {

this.weight = weight;

}

public static int getNum() {

return num;

}

public static void setNum(int num) {

People.num = num;

}

//构造函数

People(int a,int h,double w){

this.age = a;

this.height = h;

this.weight = w;

num = num+1;

this.id = num;

}

//进食函数

public void eatting(){

this.weight = this.weight + 1;

}

//运动函数

public void sporting(){

this.height = this.height + 1;

}

//睡眠函数

public void sleeping(){

this.age = this.age + 1;

this.height = this.height + 1;

this.weight = this.weight + 1;

}

//显示函数

public void show(){

System.out.println("序号："+this.id);

System.out.println("年龄："+this.age);

System.out.println("身高："+this.height);

System.out.println("体重："+this.weight);

}

//显示人数函数

public static void shownum(){

System.out.println("人数："+People.num);

}

}

2、测试类

public class TestPeople {

public static void main(String[] args) {

People[] peoples = new People[8];

System.out.println("---------------现有人数（构造对象之前）--------------------");

People.shownum();

System.out.println("------------------------------------------");

for(int i=0;ipeoples.length;i++){

peoples[i] = new People(12,178,120);

}

System.out.println("---------------现有人数（构造对象之后）--------------------");

People.shownum();

System.out.println("------------------------------------------");

//调用各成员函数

peoples[0].show();

peoples[1].eatting();

peoples[2].sporting();

peoples[3].sleeping();

System.out.println("--------------现在各对象属性值------------------");

for (People people : peoples) {

people.show();

}

}

}

找个java毕业设计题目 web方面的，要新颖 实用

我来推荐你一些题目，都是些实用而且新颖的题目，你可以参考试试，满意请给分。

基于SSM的酒店管理系统-java酒店管理系统

基于SSM的勤工助学管理系统

基于SSM的供应商管理系统

基于springbootmybatis的销售管理系统轻量级销售团队管理-java销售管理系统

基于SSM的宠物领养系统-java宠物领养系统

基于SSH的绿咖奶茶网站

基于SSH的教务管理课程管理选课管理系统

基于SSM的小区业主服务平台之垃圾回收信息管理系统

基于SSM的科技项目评估及专家会议评审系统

基于SSMEasyUI的西服门店管理系统-java门店管理服装管理系统

基于Mybatis的教学管理系统作业提交批改管理系统-java教学管理系统作业提交批改管理系统

基于SSM的图书馆座位预约管理系统占座系统-java图书馆座位预约管理系统占座系统

基于Mybatis的教学管理系统作业提交批改管理系统-java教学管理系统作业提交批改管理系统

基于SSM的驾校预约报名管理系统-java驾校预约报名管理系统

基于SSM的图书馆座位预约管理系统占座系统-java图书馆座位预约管理系统占座系统

基于SSM的水质检测系统-java水质检测系统

基于SSM的学生作业管理系统作业提交作业批改-java作业批改作业提交系统

基于springboot2.0的易居二手房网站-房屋管理系统

基于SSM的泉州信息工程学院教师测评系统-java教师测评系统

基于SSM的超市进销存管理系统-java进销存管理

关于创意java题目和java毕业设计新颖题目的介绍到此就结束了，不知道你从中找到你需要的信息了吗 ？如果你还想了解更多这方面的信息，记得收藏关注本站。