算法学习
wuxiong19930518
程序员养成中
展开
-
poj_1099
#include "stdio.h"int main(){ char printVector[200][200] = {'0'}; //存储每行输出 0:空格 1:H 2:O 3:- 4:| int scanfVector[50][50]; //存储矩形输入 int scanfSide[10] = {0}; //存储输入的矩形边长 int n = 0; int num ...原创 2018-05-08 17:16:41 · 284 阅读 · 0 评论 -
极大点问题
算法分析实验,保存备用,同时供参考交流,如有问题,请提出!#include#includeusing namespace std;vector > FirstMethod(vector > point){ vector > maxPoint;//存储极大集点 vector >::iterator it1; vector >::iterator it2; /*找极大点集*/原创 2016-03-23 22:04:41 · 753 阅读 · 0 评论 -
最小圈基问题
算法分析实验,写的有点乱,保存备用,同时供大家参考,写的不是很好,如有问题可提出交流和修改!#include#include#includeusing namespace std;static int temp = 0;//在找圈方法中用于圈个数的计数class Circle{public: Circle() { this->vertexNum = 0; this-原创 2016-03-23 21:56:15 · 1218 阅读 · 4 评论 -
文章标题
240/Search a 2D Matrix II Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: 1)Integers in each row are sorted in ascending from left原创 2015-12-25 13:16:41 · 274 阅读 · 0 评论 -
leetcode题库之241
241/Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *.Example 1 Inpu原创 2015-11-27 21:29:16 · 1160 阅读 · 0 评论 -
leetcode题库之258
258/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 + 1 = 2. Since 2 has only one digi原创 2015-11-21 13:01:25 · 621 阅读 · 0 评论 -
leetcode题库之242
242/Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false. 中文翻译: 给出两个字符串s和t,写原创 2015-11-24 17:24:31 · 726 阅读 · 0 评论 -
leetcode题库之257
257/题目:Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: [“1->2原创 2015-11-22 11:52:09 · 1281 阅读 · 0 评论