算法
github_35095990
这个作者很懒,什么都没留下…
展开
-
Bubble sort, Insertion sort, merge sort, quick sort, heap sort
#include <iostream> #include <algorithm> #include <cstdlib> #include <ctime> using std::cout; using std::endl; const int n = 80000;// bubblesort void bubble(int * a, int n) { for (int i = 0; i < n原创 2016-05-23 20:44:29 · 609 阅读 · 0 评论 -
Binary Tree
#include <iostream> using namespace std;class BinaryTree { private: struct treenode{ int key; treenode *left, *right; treenode (int k, treenode *l = 0, t原创 2016-05-25 20:05:40 · 165 阅读 · 0 评论 -
[leetcode] 368. Largest Divisible Subset
对于一个排好序的数列nums, nums[i] % nums[j] = 0 且 nums[j] % nums[k] = 0 则有 nums[i] % nums[k] = 0. 因此可以用动态规划: 用maxpos记录该子列的结尾元素下标; 数组num用num[i]记录以nums[i]为结尾元素的满足条件的子列的最大元素个数; 数组index用index[i]记录原创 2016-06-28 10:24:15 · 262 阅读 · 0 评论 -
[leetcode]367. Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library function such as sqrt.class Solution { public: bool is原创 2016-06-28 12:11:19 · 359 阅读 · 0 评论 -
[POJ] 3176 Cow Bowling
动态规划#include <iostream> #include <algorithm> using namespace std; int main() { int n; cin >> n; int ** sum = new int*[n]; sum[0] = new int; cin >> sum[0][0]; for (int i = 1; i原创 2016-06-30 20:36:27 · 226 阅读 · 0 评论 -
[leetcode]318. Maximum Product of Word Lengths
leetcode318原创 2016-06-29 13:02:03 · 240 阅读 · 0 评论