道虽迩，不行不至；事虽小，不为不成

Remove Linked List ElementsRemove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5 题意： 删除给定的节点

Contains Duplicate题意：Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false

Add Binary Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”. 题意：求两个二进制字符串相加，并把结果保存为二进制字符串。 解题思路：动态申请一个数组用于保存相加后的二进制字符串，两个二进制相加有两种可能： 1

Remove Duplicates from Sorted Array II Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array A = [1,1,1,2,2,3],Your function should return

Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2->3->3->4-

最粗暴的实现算法，没有考虑优化问题。#include<stdio.h>#include <string.h>int function(char *str);int main(){ int num,temp,i; char s[100][10002]; scanf("%d",&num); temp = num;i = 0; while(num--){

Gray Code The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequen

Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n

Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less t

Construct Binary Tree from Preorder and Inorder Traversal Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree. 题意：

Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题意：给定一颗有序数组，求出二叉搜素树 解题思路：二叉搜索树满足的条件是：左子树<根节点<右子树 采用递归思路

Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.

例如：abc，它的所有字符组合为a,b,c,ab,ac,bc,abc 对于这种类型的题，想到的第一思路就是采用递归进行求解。 首先我们申请一个与所求字符串一样大小的字符数组s，用于保存各个字符的组合。 对于abc这样字符串的进行递归实现： a,ab,abc,ac,b,bc,c 实现代码：#include <stdio.h>#include <string.h>int Recursion(

对于素数的定义，可以参考百度百科，素数（质数），除了可以被本身及1整除以外，不会再被其他数整除。典型的素数例如，2 3 5 7 11 13 17 19 23 …… 最简单的方法就是遍历这个整数m，遍历它可能存在的所有除数，例如对于11（1,2,3,4,5,6,7,8,9,10,11）只有1和11能被整除，所以判断11为素数，而对于12（1,2,3,4,5,6,7,8,9,10,11,12）可以被（

Valid Sudoku Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.A partially filled

Count and Say The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read of

Length of Last Word Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, return 0.Note

Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 题意：你去爬楼梯，需要爬n个台阶，你

Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->

Merge Sorted Array Given two sorted integer arrays A and B, merge B into A as one sorted array.Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additiona