- \n
- \u987a\u5e8f\u5904\u7406<\/strong> – \u5148\u5165\u5148\u51fa\uff0c\u4fdd\u8bc1\u4efb\u52a1\u5904\u7406\u7684\u987a\u5e8f\u6027<\/li>\n
- \u7ebf\u7a0b\u5b89\u5168<\/strong> – \u90e8\u5206\u5b9e\u73b0\u63d0\u4f9b\u5e76\u53d1\u5b89\u5168\u7684\u961f\u5217<\/li>\n
- \u963b\u585e\u652f\u6301<\/strong> – \u963b\u585e\u961f\u5217\u652f\u6301\u7b49\u5f85\u548c\u8d85\u65f6\u64cd\u4f5c<\/li>\n
- \u4f18\u5148\u7ea7<\/strong> – \u4f18\u5148\u961f\u5217\u652f\u6301\u6309\u4f18\u5148\u7ea7\u6392\u5e8f<\/li>\n<\/ul>\n
\u961f\u5217\u4e0e\u6808\u7684\u533a\u522b<\/h3>\n
\/\/ \u6808\uff08LIFO\uff09- \u540e\u8fdb\u5148\u51fa\\nStack stack = new Stack();\\nstack.push(1);\\nstack.push(2);\\nstack.pop(); \/\/ \u8fd4\u56de 2\\n\\n\/\/ \u961f\u5217\uff08FIFO\uff09- \u5148\u8fdb\u5148\u51fa\\nQueue queue = new ArrayDeque();\\nqueue.offer(1);\\nqueue.offer(2);\\nqueue.poll(); \/\/ \u8fd4\u56de 1\\n<\/code><\/pre>\n\u64cd\u4f5c\u65b9\u5f0f\u5bf9\u6bd4<\/h3>\n
\n
\n \u64cd\u4f5c<\/th>\n \u629b\u51fa\u5f02\u5e38<\/th>\n \u8fd4\u56de\u7279\u6b8a\u503c<\/th>\n \u963b\u585e<\/th>\n<\/tr>\n \n \u6dfb\u52a0<\/td>\n add()<\/td>\n offer()<\/td>\n put()<\/td>\n<\/tr>\n \n \u79fb\u9664<\/td>\n remove()<\/td>\n poll()<\/td>\n take()<\/td>\n<\/tr>\n \n \u83b7\u53d6<\/td>\n element()<\/td>\n peek()<\/td>\n –<\/td>\n<\/tr>\n<\/table>\n \u4e8c\u3001Queue \u63a5\u53e3\u8be6\u89e3<\/h2>\n
Queue \u63a5\u53e3\u7ee7\u627f\u81ea Collection \u63a5\u53e3\uff0c\u5b9a\u4e49\u4e86\u961f\u5217\u7684\u6807\u51c6\u64cd\u4f5c\u3002<\/p>\n
\u6838\u5fc3\u65b9\u6cd5<\/h3>\n
\/\/ \u6dfb\u52a0\u5143\u7d20\\nboolean add(E e); \/\/ \u8d85\u8fc7\u5bb9\u91cf\u629b\u5f02\u5e38\\nboolean offer(E e); \/\/ \u8d85\u8fc7\u5bb9\u91cf\u8fd4\u56de false\\n\\n\/\/ \u79fb\u9664\u5143\u7d20\\nE remove(); \/\/ \u961f\u5217\u4e3a\u7a7a\u629b\u5f02\u5e38\\nE poll(); \/\/ \u961f\u5217\u4e3a\u7a7a\u8fd4\u56de null\\n\\n\/\/ \u83b7\u53d6\u5143\u7d20\\nE element(); \/\/ \u961f\u5217\u4e3a\u7a7a\u629b\u5f02\u5e38\\nE peek(); \/\/ \u961f\u5217\u4e3a\u7a7a\u8fd4\u56de null\\n\\n\/\/ \u5176\u4ed6\u65b9\u6cd5\\nint size();\\nboolean isEmpty();\\nvoid clear();\\nObject[] toArray();\\n<\/code><\/pre>\n\u4e09\u3001ArrayDeque \u4f7f\u7528<\/h2>\n
ArrayDeque \u662f\u57fa\u4e8e\u6570\u7ec4\u7684\u53cc\u7aef\u961f\u5217\uff0c\u6027\u80fd\u4f18\u4e8e LinkedList\uff0c\u53ef\u4f5c\u4e3a\u6808\u548c\u961f\u5217\u4f7f\u7528\u3002<\/p>\n
1. \u57fa\u672c\u7528\u6cd5<\/h3>\n
ArrayDeque<String> deque = new ArrayDeque<>();\\n\\n\/\/ \u53cc\u7aef\u64cd\u4f5c\\ndeque.offerFirst(\"A\");\\ndeque.offerLast(\"B\");\\nString first = deque.pollFirst(); \/\/ \"A\"\\nString last = deque.pollLast(); \/\/ \"B\"\\n\\n\/\/ \u4f5c\u4e3a\u6808\u4f7f\u7528\\ndeque.push(\"X\");\\ndeque.push(\"Y\");\\nString top = deque.pop(); \/\/ \"Y\"\\n<\/code><\/pre>\n2. \u5b9e\u9645\u793a\u4f8b<\/h3>\n
public class ArrayDequeDemo {\\n public static void main(String[] args) {\\n Deque<String> deque = new ArrayDeque<>();\\n \\n \/\/ \u6a21\u62df\u6d4f\u89c8\u5668\u524d\u8fdb\u540e\u9000\\n deque.offerFirst(\"A\");\\n deque.offerFirst(\"B\");\\n deque.offerFirst(\"C\");\\n \\n while (!deque.isEmpty()) {\\n System.out.println(deque.pollFirst()); \/\/ C, B, A\\n }\\n }\\n}<\/code><\/pre>\n\u56db\u3001LinkedList \u4f7f\u7528<\/h2>\n
LinkedList \u662f\u57fa\u4e8e\u53cc\u5411\u94fe\u8868\u7684\u961f\u5217\u5b9e\u73b0\uff0c\u652f\u6301\u5728\u4e24\u7aef\u9ad8\u6548\u64cd\u4f5c\u3002<\/p>\n
1. \u57fa\u672c\u7528\u6cd5<\/h3>\n
LinkedList<String> queue = new LinkedList<>();\\n\\n\/\/ \u6dfb\u52a0\u5143\u7d20\\nqueue.offer(\"A\");\\nqueue.offer(\"B\");\\nqueue.offer(\"C\");\\n\\n\/\/ \u79fb\u9664\u5143\u7d20\\nString item = queue.poll(); \/\/ \"A\"\\n\\n\/\/ \u53cc\u7aef\u64cd\u4f5c\\nqueue.addFirst(\"X\");\\nqueue.addLast(\"Y\");\\n<\/code><\/pre>\n2. \u5b9e\u9645\u793a\u4f8b<\/h3>\n
public class LinkedListQueueDemo {\\n public static void main(String[] args) {\\n Queue<Runnable> taskQueue = new LinkedList<>();\\n \\n \/\/ \u6dfb\u52a0\u4efb\u52a1\\n taskQueue.offer(() -> System.out.println(\"Task 1\"));\\n taskQueue.offer(() -> System.out.println(\"Task 2\"));\\n \\n \/\/ \u6d88\u8d39\u4efb\u52a1\\n while (!taskQueue.isEmpty()) {\\n Runnable task = taskQueue.poll();\\n task.run();\\n }\\n }\\n}<\/code><\/pre>\n![\"Java](\"https:\/\/top.duoku.icu\/wp-content\/uploads\/2026\/04\/image-17.png\")
<\/div>\n\u4e94\u3001PriorityQueue \u4f7f\u7528<\/h2>\n
PriorityQueue \u662f\u57fa\u4e8e\u5806\u7684\u4f18\u5148\u7ea7\u961f\u5217\uff0c\u5143\u7d20\u6309\u4f18\u5148\u7ea7\u51fa\u961f\u3002<\/p>\n
1. \u57fa\u672c\u7528\u6cd5<\/h3>\n
\/\/ \u81ea\u7136\u6392\u5e8f\uff08\u5347\u5e8f\uff09\\nPriorityQueue<Integer> pq = new PriorityQueue<>();\\npq.offer(5);\\npq.offer(2);\\npq.offer(8);\\nSystem.out.println(pq.poll()); \/\/ 2\\n\\n\/\/ \u81ea\u5b9a\u4e49\u6392\u5e8f\uff08\u964d\u5e8f\uff09\\nPriorityQueue<String> pq = new PriorityQueue<String>((a, b) -> b.compareTo(a));\\n<\/code><\/pre>\n2. \u4f18\u5148\u7ea7\u573a\u666f<\/h3>\n
public class Task {\\n private String name;\\n private int priority;\\n \\n public Task(String name, int priority) {\\n this.name = name;\\n this.priority = priority;\\n }\\n \\n public int getPriority() { return priority; }\\n public String getName() { return name; }\\n}\\n\\n\/\/ \u6309\u4f18\u5148\u7ea7\u5904\u7406\u4efb\u52a1\\nPriorityQueue<Task> taskQueue = new PriorityQueue<Task>(\\n (a, b) -> b.getPriority() - a.getPriority()\\n);\\n\\ntaskQueue.offer(new Task(\"\u4f4e\u4f18\u5148\u7ea7\", 1));\\ntaskQueue.offer(new Task(\"\u9ad8\u4f18\u5148\u7ea7\", 3));\\ntaskQueue.offer(new Task(\"\u4e2d\u4f18\u5148\u7ea7\", 2));\\n\\nwhile (!taskQueue.isEmpty()) {\\n Task task = taskQueue.poll();\\n System.out.println(\"\u5904\u7406\uff1a\" + task.getName() + \"\uff0c\u4f18\u5148\u7ea7\uff1a\" + task.getPriority());\\n}\\n<\/code><\/pre>\n3. \u6027\u80fd\u8bf4\u660e<\/h3>\n
\u63d2\u5165\u548c\u5220\u9664\u65f6\u95f4\u590d\u6742\u5ea6\uff1aO(log n)\uff0c\u67e5\u8be2\u6700\u5c0f\u503c\uff1aO(1)<\/p>\n
\u516d\u3001\u963b\u585e\u961f\u5217\uff08BlockingQueue\uff09<\/h2>\n
BlockingQueue \u662f\u5e76\u53d1\u7f16\u7a0b\u4e2d\u7684\u91cd\u8981\u7ec4\u4ef6\uff0c\u652f\u6301\u963b\u585e\u5f0f\u64cd\u4f5c\uff0c\u662f\u7ebf\u7a0b\u6c60\u7684\u57fa\u7840\u3002<\/p>\n
1. \u6838\u5fc3\u5b9e\u73b0\u7c7b<\/h3>\n
ArrayBlockingQueue – \u6709\u754c\u6570\u7ec4\u961f\u5217<\/h4>\n
\/\/ \u6709\u754c\u961f\u5217\\nBlockingQueue<String> queue = new ArrayBlockingQueue<String>(10);\\n\\nqueue.put(\"A\"); \/\/ \u961f\u5217\u6ee1\u5219\u963b\u585e\\nString item = queue.take(); \/\/ \u961f\u5217\u7a7a\u5219\u963b\u585e\\n<\/code><\/pre>\nLinkedBlockingQueue – \u6709\u754c\/\u65e0\u754c\u94fe\u8868\u961f\u5217<\/h4>\n
\/\/ \u6307\u5b9a\u5927\u5c0f\u7684\u6709\u754c\u961f\u5217\\nBlockingQueue<String> queue = new LinkedBlockingQueue<String>(1000);\\n\\n\/\/ \u6216\u65e0\u754c\u961f\u5217\uff08\u5bb9\u91cf Integer.MAX_VALUE\uff09\\nBlockingQueue<String> queue = new LinkedBlockingQueue<String>();\\n<\/code><\/pre>\nPriorityBlockingQueue – \u963b\u585e\u4f18\u5148\u961f\u5217<\/h4>\n
BlockingQueue<Integer> queue = new PriorityBlockingQueue<Integer>();\\nqueue.offer(5);\\nqueue.offer(2);\\nInteger item = queue.take(); \/\/ \u8fd4\u56de 2\\n<\/code><\/pre>\nSynchronousQueue – \u540c\u6b65\u961f\u5217<\/h4>\n
\/\/ \u540c\u6b65\u961f\u5217\uff0c\u4e0d\u5b58\u50a8\u5143\u7d20\\nBlockingQueue<String> queue = new SynchronousQueue<String>();\\n\\n\/\/ put \u548c take \u5fc5\u987b\u6210\u5bf9\u51fa\u73b0\\nnew Thread(() -> {\\n try {\\n queue.put(\"A\");\\n } catch (InterruptedException e) {}\\n}).start();\\n\\nqueue.take(); \/\/ \u7b49\u5f85 put \u64cd\u4f5c\\n<\/code><\/pre>\n2. \u751f\u4ea7\u8005 – \u6d88\u8d39\u8005\u793a\u4f8b<\/h3>\n
public class ProducerConsumerDemo {\\n private static final BlockingQueue<Integer> queue = \\n new ArrayBlockingQueue<Integer>(10);\\n \\n public static void main(String[] args) {\\n \/\/ \u751f\u4ea7\u8005\\n Thread producer = new Thread(() -> {\\n try {\\n for (int i = 0; i < 10; i++) {\\n queue.put(i);\\n System.out.println(\"\u751f\u4ea7\uff1a\" + i);\\n Thread.sleep(100);\\n }\\n } catch (InterruptedException e) {}\\n });\\n \\n \/\/ \u6d88\u8d39\u8005\\n Thread consumer = new Thread(() -> {\\n try {\\n while (true) {\\n Integer item = queue.take();\\n System.out.println(\"\u6d88\u8d39\uff1a\" + item);\\n }\\n } catch (InterruptedException e) {}\\n });\\n \\n producer.start();\\n consumer.start();\\n }\\n}<\/code><\/pre>\n3. \u963b\u585e\u65b9\u6cd5\u5bf9\u6bd4<\/h3>\n
\n
\n \u65b9\u6cd5<\/th>\n \u961f\u5217\u4e3a\u7a7a<\/th>\n \u961f\u5217\u5df2\u6ee1<\/th>\n \u8bf4\u660e<\/th>\n<\/tr>\n \n put()<\/td>\n \u963b\u585e<\/td>\n \u963b\u585e<\/td>\n \u65e0\u9650\u7b49\u5f85<\/td>\n<\/tr>\n \n offer(E, t, unit)<\/td>\n \u8fd4\u56de true<\/td>\n \u963b\u585e\u7b49\u5f85<\/td>\n \u6307\u5b9a\u8d85\u65f6<\/td>\n<\/tr>\n \n take()<\/td>\n \u963b\u585e<\/td>\n \u8fd4\u56de<\/td>\n \u53d6\u5143\u7d20<\/td>\n<\/tr>\n \n poll(t, unit)<\/td>\n \u963b\u585e\u7b49\u5f85<\/td>\n \u8fd4\u56de null<\/td>\n \u53d6\u5143\u7d20\u8d85\u65f6<\/td>\n<\/tr>\n<\/table>\n \u4e03\u3001\u5b9e\u9645\u5e94\u7528\u6848\u4f8b<\/h2>\n
1. \u7ebf\u7a0b\u6c60\u5185\u90e8\u4f7f\u7528<\/h3>\n
\/\/ ThreadPoolExecutor \u5185\u90e8\u4f7f\u7528 LinkedBlockingQueue\\nThreadPoolExecutor executor = new ThreadPoolExecutor(\\n 10, 20, 60L, TimeUnit.SECONDS,\\n new LinkedBlockingQueue<Runnable>(1000)\\n);\\n<\/code><\/pre>\n2. \u6d88\u606f\u961f\u5217\u6a21\u62df<\/h3>\n
public class MessageQueue {\\n private BlockingQueue<Message> queue = new LinkedBlockingQueue<Message>();\\n \\n public void send(Message msg) throws InterruptedException {\\n queue.put(msg);\\n }\\n \\n public Message receive() throws InterruptedException {\\n return queue.take();\\n }\\n \\n public boolean sendWithTimeout(Message msg, long timeout) \\n throws InterruptedException {\\n return queue.offer(msg, timeout, TimeUnit.MILLISECONDS);\\n }\\n}<\/code><\/pre>\n3. \u4efb\u52a1\u8c03\u5ea6\u7cfb\u7edf<\/h3>\n
public class TaskScheduler {\\n private BlockingQueue<Task> taskQueue = \\n new PriorityBlockingQueue<Task>((a, b) -> \\n a.getDeadline() - b.getDeadline());\\n \\n public void schedule(Task task) {\\n taskQueue.offer(task);\\n }\\n \\n public Task getNextTask() throws InterruptedException {\\n return taskQueue.take();\\n }\\n}<\/code><\/pre>\n\u516b\u3001\u6700\u4f73\u5b9e\u8df5<\/h2>\n
1. \u9009\u62e9\u5408\u9002\u7684\u961f\u5217<\/h3>\n
- \n
- \u666e\u901a\u961f\u5217<\/strong> – ArrayDeque\uff08\u9ad8\u6027\u80fd\uff09\u6216 LinkedList<\/li>\n
- \u4f18\u5148\u7ea7\u961f\u5217<\/strong> – PriorityQueue<\/li>\n
- \u5e76\u53d1\u961f\u5217<\/strong> – ConcurrentLinkedQueue<\/li>\n
- \u963b\u585e\u961f\u5217<\/strong> – BlockingQueue \u5b9e\u73b0<\/li>\n<\/ul>\n
2. \u7ebf\u7a0b\u5b89\u5168\u8003\u8651<\/h3>\n
\/\/ \u975e\u7ebf\u7a0b\u5b89\u5168\\nQueue<String> queue = new ArrayDeque<String>();\\n\\n\/\/ \u7ebf\u7a0b\u5b89\u5168 - \u5916\u90e8\u540c\u6b65\\nsynchronized (queue) {\\n queue.add(item);\\n}\\n\\n\/\/ \u7ebf\u7a0b\u5b89\u5168 - \u5e76\u53d1\u961f\u5217\\nBlockingQueue<String> queue = new LinkedBlockingQueue<String>();\\n<\/code><\/pre>\n3. \u907f\u514d\u5e38\u89c1\u9519\u8bef<\/h3>\n
\/\/ \u274c \u9519\u8bef\uff1a\u65e0\u754c\u961f\u5217\u53ef\u80fd\u5bfc\u81f4 OOM\\nBlockingQueue<Object> queue = new LinkedBlockingQueue<Object>();\\n\\n\/\/ \u2705 \u6b63\u786e\uff1a\u4f7f\u7528\u6709\u754c\u961f\u5217\\nBlockingQueue<Object> queue = \\n new ArrayBlockingQueue<Object>(10000);\\n\\n\/\/ \u274c \u9519\u8bef\uff1a\u5ffd\u7565 InterruptedException\\nqueue.put(item);\\n\\n\/\/ \u2705 \u6b63\u786e\uff1a\u5904\u7406\u4e2d\u65ad\u5f02\u5e38\\ntry {\\n queue.put(item);\\n} catch (InterruptedException e) {\\n Thread.currentThread().interrupt();\\n throw e;\\n}\\n<\/code><\/pre>\n\u4e5d\u3001\u603b\u7ed3<\/h2>\n
Java \u961f\u5217\u662f\u5e76\u53d1\u7f16\u7a0b\u548c\u6570\u636e\u5904\u7406\u7684\u6838\u5fc3\u5de5\u5177\u3002\u638c\u63e1 Queue \u63a5\u53e3\u3001\u5404\u79cd\u5b9e\u73b0\u7c7b\u53ca\u5176\u5e94\u7528\u573a\u666f\uff0c\u80fd\u591f\u5e2e\u52a9\u5f00\u53d1\u8005\u6784\u5efa\u9ad8\u6548\u3001\u7a33\u5b9a\u7684\u5e76\u53d1\u7cfb\u7edf\u3002\u6839\u636e\u4e1a\u52a1\u9700\u6c42\u9009\u62e9\u5408\u9002\u7684\u961f\u5217\u7c7b\u578b\uff0c\u662f\u63d0\u5347\u7cfb\u7edf\u6027\u80fd\u7684\u5173\u952e\u3002<\/p>\n
\u65e0\u8bba\u662f\u666e\u901a\u7684 FIFO \u961f\u5217\u3001\u4f18\u5148\u961f\u5217\uff0c\u8fd8\u662f\u7528\u4e8e\u7ebf\u7a0b\u6c60\u7684\u963b\u585e\u961f\u5217\uff0c\u6bcf\u4e00\u79cd\u961f\u5217\u90fd\u6709\u5176\u72ec\u7279\u7684\u9002\u7528\u573a\u666f\u3002\u7406\u89e3\u5b83\u4eec\u7684\u539f\u7406\u548c\u5dee\u5f02\uff0c\u624d\u80fd\u5728\u5b9e\u9645\u5f00\u53d1\u4e2d\u505a\u51fa\u6b63\u786e\u7684\u9009\u62e9\u3002<\/p>\n
\n#Java #\u961f\u5217 #\u5e76\u53d1\u7f16\u7a0b #\u6570\u636e\u7ed3\u6784 #\u7f16\u7a0b\u6559\u7a0b<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Java \u961f\u5217\u5b8c\u6574\u6559\u7a0b\uff1a\u4ece\u57fa\u7840\u5230\u5b9e\u6218 Java \u961f\u5217\u662f\u5e76\u53d1\u7f16\u7a0b\u548c\u6570\u636e\u5904\u7406\u7684\u6838\u5fc3\u5de5\u5177\u3002\u638c\u63e1\u961f\u5217\u7684\u539f\u7406\u548c\u4f7f\u7528\u65b9\u6cd5\uff0c…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-15801","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/posts\/15801","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/comments?post=15801"}],"version-history":[{"count":0,"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/posts\/15801\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/media?parent=15801"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/categories?post=15801"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.srclibs.com\/index.php\/wp-json\/wp\/v2\/tags?post=15801"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
- \u4f18\u5148\u7ea7\u961f\u5217<\/strong> – PriorityQueue<\/li>\n
- \u7ebf\u7a0b\u5b89\u5168<\/strong> – \u90e8\u5206\u5b9e\u73b0\u63d0\u4f9b\u5e76\u53d1\u5b89\u5168\u7684\u961f\u5217<\/li>\n