qq_37815136的博客

题目一：leetcode200Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically....

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] Note: You must do this in-place without making a copy of the arr

合并链表相信大家都特别熟悉，但是如果要加上一定的输出格式，难度就会有所增加，不说了，见代码。 #include<iostream> using namespace std; struct Node{ Node *next; int data; }; void nodeprint(Node *head){ Node *node=head; while...