题:https://leetcode.com/problems/delete-operation-for-two-strings/description/ 题目 Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in
You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using
int **a = new int[5][6],这个根本编译不过去吧。 如果你想new一个二维数组出来,应该这样: int** a= new int*[5]; for (int i = 0; i < 5; ++i) { a[i] = new int[6]; } delete的时候,反过来就行了: for (int i = 0; i < 5; ++i) { del