希尔排序
12345678910111213141516/*希尔排序: 其实就是分好组(通过步长)然后对每组进行插入排序 这里步长选择都是从n/2开始，每次再减半，直到最后为1。*/void shellsort3(int a[], int n) { int
NextPermutation
/*Implement next permutation, which rearranges numbers into the lexicographicallynext greater permutation of numbers. If such arrangement is
Divide-Two-Integers
/* Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.*/ 题意：模拟除法, 不允许使用除法, 乘法
Remove-Element
1234567/* * Given an array and a value, remove all instances of that value in place and * return the new length. * The order of elements ca
Remove-Duplicates-From-Sorted-Array
12345678910111213/* * Given a sorted array, remove the duplicates in place such that each element * appear only once and return the new len
Swap-Nodes-In-Pairs
/* Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the
Merge-K-Sorted-Lists
/* Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.//* Definition for singly-linked list.
Three-Sum-Closest
/* Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the
Three-Sum
/* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which g
一个数组里找两个相加为N的组合
题目：一个数组里找两个相加和为N的组合 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646