一个机器，每 1 秒会生成一个随机数。
机器需要提供另外一个方法，方法内容就是找出刚刚过去的 10 秒内，生成的数中的最大的数和最小的数。
请设计该机器内，用于计算最大值和最小值的数据结构。
语言要求：我只会 java、js 和 go，其他我都看不懂。
建议用 go，配合 playground 来演示。
算法练习：求最大值和最小值
本贴最后更新于 3290 天前，其中的信息可能已经时移世改
-
算法
428 引用 • 254 回帖 • 24 关注
相关帖子
-
-
-
tomaer •
package com.dashu; import java.util.ArrayList; import java.util.Comparator; import java.util.List; import java.util.PriorityQueue; import java.util.Queue; import java.util.Random; public class DaShu { static Comparator<Integer> cmp = new Comparator<Integer>() { public int compare(Integer e1, Integer e2) { return e2 - e1; } }; static Queue<Integer> sortQueue = new PriorityQueue<Integer>(10,cmp); public static void main(String[] args) throws Exception { while(true){ Thread.sleep(1000); sortQueue.add(random()); if(sortQueue.size() == 10){ List<Integer> list = new ArrayList<Integer>(); for(int i = 0;i<sortQueue.size();i++){ if(i == 0){ System.out.println("Max :"+sortQueue.poll()); } list.add(sortQueue.poll()); } sortQueue.addAll(list); System.out.println("Min: "+list.get(list.size() - 1)); System.out.println("------------------------------------"); } } } public static int random(){ int max=10000; int min=1; Random random = new Random(); return random.nextInt(max)%(max-min+1) + min; } }代码已完成，没什么算法，就为了打非要算法人的脸。还有我的 500 奖励坐着到账
-
-
我来个可读性好点的,思路是使用固定长度（长度可自定义，按这里的要求设为 10 就可以）队列数据结构，先进先出。
var code = "code"public interface Queue<T> { public void push(T t); public T poll(); public int size(); public T peak(); public boolean isEmpty(); public boolean isFull(); } -
var code=" import java.util.ArrayList;import java.util.List;
public class ArrayQueue implements Queue {
List data;
int capacity;public ArrayQueue(int capacity) { data = new ArrayList<T>(); this.capacity = capacity; } public void push(T t) { if (this.capacity == data.size()) { data.remove(0); } data.add(t); } public T poll() { T t = data.remove(0); return t; } public int size() { return data.size(); } public T peak() { return data.get(data.size() - 1); } public boolean isEmpty() { return 0 == data.size(); } public boolean isFull() { return capacity == data.size(); } public static void main(String[] args) { ArrayQueue<Integer> queue = new ArrayQueue<Integer>(10); for (int i = 0; i < 10; i++) { queue.push(i); } System.out.println(queue.capacity); System.out.println(queue.peak()); System.out.println(queue.poll()); queue.push(new Integer(11)); System.out.println(queue.data); }}
" -
调用及测试类
var code =
import java.util.List;public class Operation {
public static void main(String[] args) { ArrayQueue<Integer> queue = new ArrayQueue<Integer>(10); for(int i = 0 ;i< 10;i++){ queue.push(i); } System.out.println(queue.capacity); System.out.println(queue.peak()); System.out.println(queue.poll()); queue.push(new Integer(10)); queue.push(new Integer(11)); queue.push(new Integer(12)); queue.push(new Integer(13)); queue.push(new Integer(14)); queue.push(new Integer(15)); System.out.println(queue.data); System.out.println("最大值："+Operation.max(queue.data)); System.out.println("最小值："+Operation.min(queue.data)); } public static int max(List<Integer> list){ int max = list.get(0); for(Integer cur: list){ max = max <cur? cur:max; } return max; } public static int min(List<Integer> list){ int min = list.get(0); for(Integer cur: list){ min = min >cur? cur:min; } return min; }}
-
-
x4storm •
js 版本奉上
var Data = { init: function() { this.interval(1000); }, pool: [], maxCount: 10000, generate: function() { var num = Math.ceil(Math.random() * 10000); this.pool.push(num); if (this.pool.length > this.maxCount) { this.pool.splice(0, this.pool.length - 10); } }, interval: function(interTime) { var self = this; setInterval(function() { self.generate(); }, interTime); } } function getNum(count, Data) { var sets = Data.slice(Data.length - count, Data.length); console.log(sets); console.log("Max is : ", Math.max.apply(null, sets)); console.log("Min is : ", Math.min.apply(null, sets)); } Data.init(); getNum(10, Data.pool);😄
-
x4storm •
markdown 不支持反引号引导的代码块。。。
var Data = { init: function() { this.interval(1000); }, pool: [], maxCount: 10000, holdCount: 100, generate: function() { var num = Math.ceil(Math.random() * 10000); this.pool.push(num); if (this.pool.length > this.maxCount) { this.pool.splice(0, this.pool.length - holdCount); } }, interval: function(interTime) { var self = this; setInterval(function() { self.generate(); }, interTime); } } function getNum(count, Data) { var data=Data.pool; Data.holdCount=count; var sets = data.slice(data.length - count, data.length); console.log(sets); console.log("Max is : ", Math.max.apply(null, sets)); console.log("Min is : ", Math.min.apply(null, sets)); } Data.init(); getNum(10, Data);😄
-
crick77 •
var foo = {
max: null,
min: null,
timer: null,
mainTimer: null,
getMax: function() {
return this.max;
},
getMin: function() {
return this.min;
},
ctor: function(data) {
this.max = data;
this.min = data;
},
generate: function() {
return parseInt(Math.random() * 100);
},
start: function() {
//console.log('start');
var tmp = foo.generate();
this.max || this.ctor(tmp);
this.max = tmp > this.max ? tmp : this.max;
this.min = tmp < this.min ? tmp : this.min;
//console.log(this.getMax());
//console.log(this.getMin());
this.timer = setTimeout(function() {
foo.start()
}, 1000);
},
run: function(vTime) {
if (!this.timer) {
foo.start();
} else {
console.log('max:' + foo.getMax());
console.log('min:' + foo.getMin());
}foo.ctor(foo.generate()); var time = vTime || 10000; this.mainTimer = setTimeout(function() { foo.run(time); }, time); }, stop: function() { window.clearTimeout(this.timer); window.clearTimeout(this.mainTimer); }}
//foo.run(1000);
foo.run(); -
-
请输入回帖内容
...
欢迎来到这里！
我们正在构建一个小众社区，大家在这里相互信任，以平等 • 自由 • 奔放的价值观进行分享交流。最终，希望大家能够找到与自己志同道合的伙伴，共同成长。
注册 关于