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. For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0]. N...

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes. You should try to do it in place. The program should run in O(1) space compl...

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. For example, Given input array n...

求两个数的最大公因子，使用“辗转相除法”。 原理如下：若r=a%b，则gcd(a,b)=gcd(b,r)。 简单推导： 因为r=a%b，所以a=bq+r，r=a-bq。 a=bq+r，能被b,r整除的，则一定能被a整除，自然也能被a,b整除 r=a-bq，能被a,b整除的，则一定可以被r整除，自然也能被b,r整除 显然...

题目：如何查找单链表的倒数第n个指针。 算法一：第一次遍历到链表末尾，找到链表长度N；第二遍遍历，找到第N-n个节点。 算法二：设立两个指针，p1指向头节点，p2往前走n步，这样，p2与p1之间间隔n个指针。这样，当p2到达末尾是，p1则为倒数第N-n个节点。 ...

题目：给定数组str[]，循环左移m位。即如果str=”ABCDEF”，循环左移2位得到 “CDEFAB”。 算法：使用两个倒序，倒序AB得到BA，倒序CDEF得到FEDC，最后全部BAFEDC全部倒序CDEFAB。 C #include <string.h> ...