codility-java-solutions:在 Java 中解决的 Codility 课程

上传者: 42119358 | 上传时间: 2022-04-26 16:33:00 | 文件大小: 52KB | 文件类型: ZIP
Java Codility 解决方案 在 Java 中解决的 Codility 课程: 时间复杂度 磁带平衡 蛙跳 遗漏元素 计数元素 永久检查 蛙河一号 缺少整数 最大计数器 前缀和 过往汽车 计数分区 MinAvgTwoSlice 基因组范围查询 排序 三个最大乘积 三角形 清楚的 圆盘交叉点数 堆栈和队列 括号 嵌套 石墙 鱼 领导 统治者 平等领袖 最大切片问题 最大利润 最大双切片和 最大切片和 质数和合数 计数因素 最小周长矩形 峰值 旗帜 埃拉斯托尼筛 计算半素数 不可分计数 欧几里得算法 巧克力 公因数 斐波那契数列 梯子 蛙蛙 二分查找算法 最小最大除法 钉板 毛毛虫法 绝对区别 计数三角形 CountDistinctSlices 两个的最小总和 贪心算法系绳

文件下载

资源详情

[{"title":"( 44 个子文件 52KB ) codility-java-solutions:在 Java 中解决的 Codility 课程","children":[{"title":"codility-java-solutions-master","children":[{"title":"src","children":[{"title":"leader","children":[{"title":"EquiLeader.java <span style='color:#111;'> 2.49KB </span>","children":null,"spread":false},{"title":"Dominator.java <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false}],"spread":true},{"title":"sieveoferastothenes","children":[{"title":"CountSemiprimes.java <span style='color:#111;'> 3.04KB </span>","children":null,"spread":false},{"title":"CountNonDivisible.java <span style='color:#111;'> 2.33KB </span>","children":null,"spread":false}],"spread":true},{"title":"countingelements","children":[{"title":"PermCheck.java <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false},{"title":"MaxCounter.java <span style='color:#111;'> 2.56KB </span>","children":null,"spread":false},{"title":"FrogRiverOne.java <span style='color:#111;'> 1.64KB </span>","children":null,"spread":false},{"title":"MissingInteger.java <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false}],"spread":true},{"title":"prefixsums","children":[{"title":"GenomicRangeQuery.java <span style='color:#111;'> 4.01KB </span>","children":null,"spread":false},{"title":"PassingCars.java <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"MinAvgTwoSlice.java <span style='color:#111;'> 2.83KB </span>","children":null,"spread":false},{"title":"CountDiv.java <span style='color:#111;'> 962B </span>","children":null,"spread":false}],"spread":true},{"title":"stackandqueue","children":[{"title":"Brackets.java <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false},{"title":"Nesting.java <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"Fish.java <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"StoneWall.java <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false}],"spread":true},{"title":"greedyalgorithms","children":[{"title":"TieRope.java <span style='color:#111;'> 2.25KB </span>","children":null,"spread":false}],"spread":true},{"title":"timecomplexity","children":[{"title":"FrogJump.java <span style='color:#111;'> 1.27KB </span>","children":null,"spread":false},{"title":"TapeEquilibrium.java <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"PermMissingElements.java <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false}],"spread":true},{"title":"euclideanalgorithm","children":[{"title":"CommonPrimeDivisors.java <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"ChocoladeByNumbers.java <span style='color:#111;'> 1.91KB </span>","children":null,"spread":false}],"spread":true},{"title":"fibonaccinumbers","children":[{"title":"FibFrog.java <span style='color:#111;'> 3.70KB </span>","children":null,"spread":false},{"title":"Ladder.java <span style='color:#111;'> 2.65KB </span>","children":null,"spread":false}],"spread":true},{"title":"primeandcompositenumbers","children":[{"title":"Flags.java <span style='color:#111;'> 3.26KB </span>","children":null,"spread":false},{"title":"MinPerimeterRectangle.java <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"Peaks.java <span style='color:#111;'> 3.62KB </span>","children":null,"spread":false},{"title":"CountFactors.java <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"caterpillar","children":[{"title":"AbsDistinct.java <span style='color:#111;'> 1.93KB </span>","children":null,"spread":false},{"title":"MinAbsSumOfTwo.java <span style='color:#111;'> 3.09KB </span>","children":null,"spread":false},{"title":"CountDistinctSlices.java <span style='color:#111;'> 2.37KB </span>","children":null,"spread":false},{"title":"CountTriangles.java <span style='color:#111;'> 1.89KB </span>","children":null,"spread":false}],"spread":true},{"title":"sorting","children":[{"title":"Triangle.java <span style='color:#111;'> 1.60KB </span>","children":null,"spread":false},{"title":"NumberOfDiscIntersection.java <span style='color:#111;'> 1.59KB </span>","children":null,"spread":false},{"title":"Distinct.java <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"MaxProductOfThree.java <span style='color:#111;'> 1.64KB </span>","children":null,"spread":false}],"spread":true},{"title":"binarysearch","children":[{"title":"NailingPlanks.java <span style='color:#111;'> 3.88KB </span>","children":null,"spread":false},{"title":"MinMaxDivision.java <span style='color:#111;'> 3.28KB </span>","children":null,"spread":false}],"spread":false},{"title":"maximumslice","children":[{"title":"MaxDoubleSliceSum.java <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"MaxSliceSum.java <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false},{"title":"MaxProfit.java <span style='color:#111;'> 2.61KB </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'> 1020B </span>","children":null,"spread":false},{"title":".classpath <span style='color:#111;'> 295B </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 22B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明