#include <iostream> using namespace std; //循环队列(少用一个空间)长度 #define M (8+1) typedef struct node { int index; int nextIndex; } Node; Node* init(int front, int len) { //限制少用一个空间,没有限制少用一个下标,所以front>M-1 if (front > M - 1 || len > M - 1) { return…
简单题 package my_basic.class_3; public class Code_10_PrintCommonPart { public static class Node{ int value; Node next; public Node(int value) { super(); this.value = value; } } public static void printCommonPart(Node head1,Node head2) { System.out.prin…