module tb_fifo();
reg clk,rst;
initial begin
clk=0;
forever #4.545 clk=~clk;
end
initial begin
rst=1;
#9.09 rst=0;
end
reg [31:0] cnts;
always @ (posedge clk or posedge rst)
begin
if(rst)
begin
cnts <=32'd0;
end
else
begin
cnts <= cnts +1'b1;
end
end
reg [7:0] din;
reg wr_en;
reg rd_en;
wire [31:0] dout;
wire [12:0] rd_data_count;
wire [14:0] wr_data_count;
fifo_ICBR_8_32 FIFO(.rst(rst),// input wire rst.wr_clk(clk),// input wire wr_clk.rd_clk(clk),// input wire rd_clk.din(din),// input wire [7 : 0] din.wr_en(wr_en),// input wire wr_en.rd_en(rd_en),// input wire rd_en.dout(dout),// output wire [31 : 0] dout.full(),// output wire full.empty(),// output wire empty.rd_data_count(rd_data_count),// output wire [12 : 0] rd_data_count.wr_data_count(wr_data_count)// output wire [14 : 0] wr_data_count);
always @ (posedge clk or posedge rst)
begin
if(rst)
begin
din <=8'd0;
wr_en <=1'b0;
rd_en <=1'b0;
end
else
begin
case(cnts)32'd33: begin din<=8'h11;wr_en<=1'b1; end
32'd34: begin din<=8'h22;wr_en<=1'b1; end
32'd35: begin din<=8'h33;wr_en<=1'b1; end
32'd36: begin din<=8'h44;wr_en<=1'b1; end
32'd37: begin wr_en<=1'b0; end
32'd60: begin rd_en<=1'b1; end
32'd61: begin rd_en<=1'b0; end
default:begin din<=din;wr_en<=wr_en;rd_en<=rd_en; end
endcase
end
end
1.两个链表第一个公共子节点 1.这是一道经典的链表问题:输入两条链表,找出他们的第一个公共节点。 使用集合的方法:
public ListNode findFirstCommonNodeBySet(ListNode headA,ListNode headB){Set<ListNode> set new HashSet<&g…