摘要： The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all 阅读全文

摘要： Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. For example: Input: ["tea","and","a 阅读全文

摘要： Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-neg 阅读全文

摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeat 阅读全文

摘要： Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the or 阅读全文

摘要： Divide two integers without using multiplication, division and mod operator. 方法一：暴力破解，不断用被除数减去除数，直至出现负数停止，铁定超时。 方法二：对方法一的改进，每次寻找 满足2k-1 * 除数 <= 被除数 < 阅读全文

摘要： 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 fo 阅读全文

摘要： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then l 阅读全文

摘要： Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your a 阅读全文

摘要： Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 方法一：暴力破解，1和2合并，合并后再和3合并，合并后再和4合并。。。如此下去一直将所有链表节点全部合 阅读全文