算法题
Hello World程序员
这个作者很懒,什么都没留下…
展开
-
求平面两点最短距离minimum distance
Problem descriptionGiven N(2<=N<=100,000) points on the plane, find the nearest two points, print the minimum distance.InputLine 1: an integer N, stands for the total number of points. N l...原创 2018-10-12 00:21:37 · 1711 阅读 · 1 评论 -
暴力求最大回文串
#include <iostream>#include<string>using namespace std;bool flag = false;bool isvalue(string str){ int strln=str.length(); for (int i = 0, j = strln - 1; i < j;i++,j--) {//条件判断...原创 2017-09-22 17:31:47 · 276 阅读 · 0 评论 -
大数阶乘
//大数阶乘N http://blog.csdn.net/petershina/article/details/45070359//http://blog.csdn.net/abcjennifer/article/details/7271844//http://blog.csdn.net/liuchang54/article/details/40379833#include<st...原创 2017-09-22 17:34:52 · 403 阅读 · 0 评论 -
大数相加
#include<iostream>#include <string.h> using namespace std;#define MAXSIZE 1000int main(){ char number1[MAXSIZE + 1]; char number2[MAXSIZE + 1]; char sum[MAXSIZE + 2]; char te...原创 2017-09-22 17:43:34 · 275 阅读 · 0 评论 -
单链表反转
#include "iostream"using namespace std;struct node{ int data; node *next;};node* reverse(node *head){ node* p1 = NULL; node* p2 = NULL; node* p3 = NULL; //while (head == NULL) return 0;...原创 2017-09-22 17:44:22 · 318 阅读 · 0 评论 -
单链表环相关问题
#include <iostream> #include <string> #define LEN 8using namespace std;#include <stdio.h>struct Node{ int val; Node *next; };//判断是否有环bool isLoop(Node *pHead){ ...原创 2017-09-22 17:45:06 · 284 阅读 · 0 评论 -
递归建立普通二叉树两种方式遍历
#include<bits/stdc++.h> using namespace std;struct BinNode{ char data; BinNode* lchild; BinNode* rchild;};int CreateBinTree1(BinNode* &T)//建立时候按先序建立,先画出来对照先序输入中间无空格 { char data;...原创 2017-09-22 17:45:42 · 352 阅读 · 0 评论 -
二叉树前序中序输出后序
前序遍历: 1.访问根节点 2.前序遍历左子树 3.前序遍历右子树 中序遍历: 1.中序遍历左子树 2.访问根节点 3.中序遍历右子树 后序遍历: 1.后序遍历左子树 2.后序遍历右子树 3.访问根节点给定一个二叉树前序和中序串,输出后序串 //k和leftnum注意写对关系#i...原创 2017-09-22 17:46:59 · 443 阅读 · 0 评论 -
#33. Money robbing
Problem description:A robber is planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacen...原创 2018-11-27 17:19:26 · 843 阅读 · 0 评论 -
Volunteer recruitment
DescriptionSuppose you will recruit a group of volunteers for a coming event. It is estimated that this event will take N days to complete, and the i(th) day needs at least Ai volunteers. The number...原创 2018-12-10 23:42:46 · 1801 阅读 · 0 评论 -
Airplane Landing Problem
Problem DescriptionWith human lives at stake, an air traffic controller has to schedule the airplanes that are landing at an airport in order to avoid airplane collision. Each airplane iihas a time ...原创 2018-12-10 23:43:38 · 1349 阅读 · 5 评论 -
八皇后N皇后问题
//环境为VS2015#include <iostream>using namespace std;const int N = 8;//皇后的个数int positon[N];//存放皇后的位置int num = 0;//记录有多少种摆法 /*判断第row行放置的位置是否满足要求*/bool valid(int row){ for (int i =...原创 2017-09-22 17:30:45 · 335 阅读 · 0 评论 -
1234变4321[字符串反转]
int reverse(int num){ int c = 0; int ra=0; while (num>0) { c = num % 10; ra = ra*10 + c; num = num / 10; } return ra;}原创 2017-09-22 17:28:08 · 7433 阅读 · 0 评论 -
Find the kth largest element in an unsorted array A
Problem descriptionFind the kth largest element in an unsorted array A . Note that it is the kth largest element in the sorted order, not the kth distinct element. The range of length of A is N(1≤N≤...原创 2018-10-08 20:50:19 · 538 阅读 · 0 评论 -
Top 1 path
有一个M行N列的矩阵,其中部分格子里面有一些有价值的物品。 现在你从左上角出发,每次只能想右或者向下走。 走到右下角的时候,你能获取的物品的总价值最大有多少? 输入数据: 第一行有两个数字M N,表示这个矩阵有M行N列。 然后从第二行开始,有M行整数,每行都有N个非负整数,表示这一格的物品价值。 输出数据: 可以获取的最大的物品总价值 数据范围:0<M,N<=1000,...原创 2018-10-31 13:13:06 · 235 阅读 · 0 评论 -
Top k path--动态规划
DescriptionA robot is located at the top-left corner of a m×nm×n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the ...原创 2018-11-03 16:09:02 · 510 阅读 · 0 评论 -
Longest Increasing Subsequence
DescriptionA numeric sequence of aiai is increasing if a1<a2<⋯<aNa1<a2<⋯<aN. Let the subsequence of the given numeric sequence (a1,a2,…,aN)(a1,a2,…,aN) be any sequence (ai1,ai2,......原创 2018-10-30 12:16:41 · 243 阅读 · 0 评论 -
Cross the river
Problem description:Some people want to cross a river by boat. Each person has a weight, and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, provi...原创 2018-11-15 14:14:12 · 1354 阅读 · 4 评论 -
Assign banana to monkeys
Problem description:There are N Monkeys and N bananas are placed in a straight line. Each monkey want to have a banana, if two monkeys want to own the same banana, there will be a fight! A monkey ca...原创 2018-11-15 16:53:52 · 2174 阅读 · 6 评论 -
Maximum profit of transactions
Problem descriptionSay you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions ....原创 2018-11-21 22:08:37 · 851 阅读 · 1 评论 -
Greedy Algorithm 图论-度序列可图性判断(Havel-Hakimi定理)
Given a list of n natural numbers d1, d2,...,dn, show how to decide in polynomial time whether there exists an undirected graph G = (V, E) whose node degrees are precisely the numbers d1, d2, · · · , ...原创 2018-11-23 16:52:43 · 1773 阅读 · 1 评论