搜索资源列表
258.AddDigits
- Leetcode 258.Add Digits Leetcode 第258题AC源码。-Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3+ 8 = 11, 1+
binarySearchTreeIterator
- leetcode binarySearchTreeIterator
leetcode
- 计算n以内的质数个数。（由于文件小于1kb，禁止上传，所以就复制了几个副本） 采用欧拉算法，运行速度极快，100000000以内的数字，只要几毫秒就可得出结果-Calculate the number of quality within the number n. (Because the file is less than 1kb, prohibit the uploading, so I copied several copie
LeetCode
- letcode 002和003的 c#版的解决方案-Letcode c# 002 and 003 version of the solution
javacode
- leetcode算法源码，包括多种解法以及注释，-leetcode Algorithm source code，including multi methods and annotation
NQueens
- leetcode上最快的N皇后解法 我自己的代码-the best solution
code
- leetcode上部分编程题，利用C/C++实现。-Completing the part of the programming questions in leetcode.com with C/C++.
letcode
- leetcode算法题，都是最简单的python算法实现-Leetcode u7B97 u6CD5 u5B9 u7R
longest substring
- 利用C++实现Leetcode题目中的寻找最长子序列问题，即从一个序列中查找符合标准的子序列，算法复杂度和时间复杂度均较好(C++ implementation of the oldest sequence)
新建文件夹
- 面试题目 判断两个字符串是否是相似字符串。要求删除不同的字符之后两个字符串是相等的(Interview questions determine whether two strings are similar strings. Requires to delete two characters after the two strings are equal)
LintCode-master
- 包含leetcode上大部分题目的源代码 java语言编写(Contains most of the topics on the leetcode source code, Java language)
wigglesort
- wiggle sort算法,leetcode
TwoSum
- 找出数组numbers中的两个数，它们的和为给定的一个数target，并返回这两个数的索引，比如numbers={2,7,11,17}; target=9。那么返回一个元组(0,1)。 这道题不需要去重，对于每一个target输入，只有一组解，索引要按照大小顺序排列。(Find the two numbers in the array numbers, and their sum is given a target number, a
0301_treeScan
- 列举了大部分树的遍历方法，包括深度优先遍历，广度优先遍历，morris遍历等(tree scan method, deep first, wide first, morris)
Zuo
- 使用C++语言实现了汉诺塔过程，递归过程(using c++ to implete hanoi)
2.1.7
- Two Sum Given an array of integers, find two numbers such that they add up to a specific target number.The function two Sum should return indices of the two numbers such that they add up to the target, whereindex1 mus
135
- implement leet code 135 a
sudoku_solver
- sudok solver 的算法实现， 采用dfs方法实现(sudok solver algorithm)
leetbook
- LeetCode编程题目的答案总结，有大部分，但是并不是全部。(Most of the answers to the LeetCode programming questions are, but not all.)
leetcode
- count the pages of pdf files,when the file fail to open, return the location of it.