码迷,mamicode.com
首页 >  
搜索关键字:oj    ( 4253个结果
【原创】leetCodeOj ---Partition List 解题报告
原题地址:https://oj.leetcode.com/problems/partition-list/题目内容:Given a linked list and a valuex, partition it such that all nodes less thanxcome before nod...
分类:其他好文   时间:2014-11-26 18:47:01    阅读次数:196
UVA OJ 623 500!
500!In these days you can more and more often happen to see programs which perform some useful calculations being executed rather then trivial screen ...
分类:其他好文   时间:2014-11-25 20:32:26    阅读次数:279
九度OJ 1017 还是畅通工程
#include #include #include #include #include #include #include using namespace std;struct Node{ int startPoint; int endPoint; int len; boo...
分类:其他好文   时间:2014-11-25 16:15:04    阅读次数:172
UVA OJ 10035 - Primary Arithmetic
Primary ArithmeticChildren are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a ...
分类:其他好文   时间:2014-11-24 22:16:13    阅读次数:205
九度OJ 1016 火星A+B AC版
#include #include #include #include #include #include using namespace std;int susuTable[28]={1};bool isLear(int num){ if(num==2) return true...
分类:其他好文   时间:2014-11-24 22:11:19    阅读次数:200
九度OJ 1016 火星A + B 未AC版,整型存储不下
#include #include #include #include #include #include using namespace std;int susuTable[28]={1};bool isLear(int num){ if(num==2) return true...
分类:其他好文   时间:2014-11-24 22:07:01    阅读次数:233
UVa OJ 455 Periodic Strings
Periodic StringsA character string is said to have periodkif it can be formed by concatenating one or more repetitions of another string of lengthk. F...
分类:其他好文   时间:2014-11-24 20:45:26    阅读次数:175
【LeetCode】Clone Graph (2 solutions)
Clone GraphClone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are l...
分类:其他好文   时间:2014-11-24 20:35:18    阅读次数:243
九度OJ 1014 排名
#include #include #include #include #include #include using namespace std;struct People{ string name;//准考证号 int solutionNum;//做出题目的个数 //vecto...
分类:其他好文   时间:2014-11-24 17:06:50    阅读次数:209
九度OJ 1011 最长子串
#include #include #include #include using namespace std;int main(){ int arr[10000]; int maxNum=0; int maxNow = 0; int startNum=0,endNum = ...
分类:其他好文   时间:2014-11-24 11:36:42    阅读次数:141
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!