csharp基础练习题:水煮蛋【难度:1级】: 你是世界上最伟大的厨师.没有人像你一样煮鸡蛋!您的餐厅总是满满的客人,他们喜欢煮鸡蛋.但是当煮??鸡蛋的顺序更高时,你需要一些时间,因为你的工作只有一个锅.你需要多长时间? 你的任务 实现一个函数,它取一个非负整数,表示煮沸的蛋数.它必须以分钟为单位返回时间(整数),这是将所有鸡蛋煮沸所需的时间. 规则一次最多可以将8个鸡蛋放入锅中 煮鸡蛋需要5分钟 我们假设水一直沸腾(没时间加热) 为...
拆分部件【难度:1级】: 答案1: public class Kata {public static string SplitInParts(string s, int partLength){ for(int i = partLength; i < s.Length; i += partLength + 1)s = s.Insert(i, " ");return s; } } ? 答案2: using System;public class Kata {public static string SplitInParts(string s, int partLength){ for(int i = partLength; i < s.Length; i += partLength + 1)s = s.Insert(i, " ");return s; ...
自定义访问者【难度:1级】: 答案1: namespace CustomAccessors {using System;public class NumericAccessor{private int _number;public int Number{get{return _number/2; }set{if(value % 2 != 0) { throw new ArgumentException("value not divisble by 2");}_number = value;}}} }? 答案2: namespace CustomAccessors {using System;public class NumericAccessor{private int _number;public int Number{get { return _num...
取一个数字并将它的数字总和提升到连续的力量和… Eureka !!【难度:2级】: 答案1: using System; using System.Collections.Generic; using System.Linq; public class SumDigPower {public static long[] SumDigPow(long a, long b) {List<long> values = new List<long>();for (long x = a; x <= b; x++){if (x.ToString().Select((c, i) => Math.Pow(Char.GetNumericValue(c), i + 1)).Sum() == x)values.Add(x);}return values...
csharp基础练习题:初学者系列#2时钟【难度:0级】: 时钟显示午夜后’h’小时,m’分钟和’s’秒. 你的任务是制作’过去’功能,返回转换为毫秒的时间. 例: 过去(0,1,1)== 61000 过去(0,1,1)== 61000 过去(0,1,1)== 61000 过去(0,1,1)== 61000 过去(0,1,1)== 61000 注意! h,m和s将只是自然数! 等待翻译和反馈!谢谢! 编程目标:using System;public static class Clock{public static int Past(int h, int m, int s){//#Happy Coding! ^_...
这是几个世纪?【难度:2级】: 答案1: public class Kata {public static string WhatCentury(string year){var century = (int.Parse(year) - 1) / 100 + 1;return century.ToString() + GetSuffix(century);}private static string GetSuffix(int century){if ((century / 10) % 10 != 1){switch (century % 10){case 1:return "st";case 2:return "nd";case 3:return "rd";}}return "th";} } ? 答案2: using System; using System...
电话目录【难度:3级】: 答案1: using System; using System.Linq; using System.Text.RegularExpressions;public class PhoneDir {private static Regex _regexPhone = new Regex(@"\/?\+([\d-]+);? ?");private static Regex _regexName = new Regex(@"<(.+)>");private static Regex _regexClean = new Regex("[$:;/,!?*]");public static string Phone(string strng, string num){string record;try{record = strng.Split('\n'...
帮助书商!【难度:2级】: 答案1: using System.Linq;public class StockList {public static string stockSummary(string[] lstOfArt, string[] lstOf1stLetter) {if (!lstOfArt.Any()) return "";return string.Join(" - ",lstOf1stLetter.Select(c => string.Format("({0} : {1})", c, lstOfArt.Where(a => a[0] == c[0]).Sum(a => int.Parse(a.Split(' ')[1])))));} }? 答案2: using System;public class StockList {public stat...
初学者系列#2时钟【难度:0级】: 答案1:using System;public static class Clock{public static int Past(int h, int m, int s){return (int)(new TimeSpan(h, m, s)).TotalMilliseconds;}} ? 答案2: using System; public static class Clock {public static int Past(int h, int m, int s){return (int)new TimeSpan(h, m, s).TotalMilliseconds;} } ? 答案3:using System;public static class Clock{public static int Past(int ...
csharp基础练习题:查找列表的最大值和最小值【难度:0级】: 你的任务是做两个函数, 最大和 最小值(在PHP和Python中为`maximum`和`minimum`),它们采用整数的向量数组/向量将 列为输入和输出,分别是该数组/向量中的最大和最小数字. # 例子 ```cpp max({4,6,2,1,9,63,-134,566})返回566 min({ - 52,56,30,29,-54,0,-110})返回-110 max({5})返回5 min({42,54,65,87,0})返回0 max({4,6,2,1,9,63,-134,566})返回566 min({ - 52,56,30,29...
数字和数字根的总和【难度:2级】: 答案1: public class Number {public int DigitalRoot(long n){return (int)(1 + (n - 1) % 9);} }? 答案2: public class Number {public int DigitalRoot(long n){return (int)(1 + ((n -1) % 9));} }? 答案3: public class Number {public int DigitalRoot(long n){// Your awesome code here!return (int)(1+(n-1)%9);} }? 答案4: public class Number {public int DigitalRoot(long n){if (n ...
行权重【难度:1级】: 答案1: using System.Linq; class Kata {public static int[] RowWeights(int[] a){return new int[] { a.Select((x, y) => y % 2 == 0 ? x : 0).Sum(), a.Select((x, y) => y % 2 == 0 ? 0 : x).Sum() };} }? 答案2: class Kata {public static int[] RowWeights(int[] a){int[] ret = new int[2];for(int i = 0; i < a.Length; i++){if(i % 2 == 0){ret[0] += a[i];}else{ret[1] += a[i];}}return ret;} }? ...
连续k-Primes【难度:3级】: 答案1: using System;class PrimeConsec {private static int countPrimeDiv(long n) {int cnt = 0;for (long i = 2; i * i <= n; i++) {while (n % i == 0) {cnt++;n /= i;}}if (n > 1) cnt++;return cnt;}public static int ConsecKprimes(int k, long[] arr) {int cnt = 0;for (int i = 0; i < arr.Length - 1; ++i)if ((countPrimeDiv(arr[i]) == k) && (countPrimeDiv(arr[i+1]) == k))cn...
整数深度【难度:2级】: 答案1: using System.Collections.Generic;namespace Solution {public class Kata {public static int ComputeDepth(int n){var intArray = new HashSet<char>(new [] { '0','1','2','3','4','5','6','7','8','9' });var i = 1;for (; intArray.Count > 0; i++) {foreach (var c in (i*n).ToString()) intArray.Remove(c);}return i-1;}} }? 答案2: using System.Collections.Generic; using System.Linq;...
csharp基础练习题:找到流浪号码【难度:1级】: 给你一个* 奇数长度的整数数组,其中所有这些都是相同的,除了一个数字. 完成接受这样一个数组的方法,并返回该单个不同的数字. ** 输入数组始终有效!**(奇数长度> = 3) 例子PY [1,1,2] ==> 2 [17,17,3,17,17,17,17] ==> 3 ? 迷路(3,{1,1,2})== 2 流浪(7,{17,17,3,17,17,17,17})== 3 编程目标: class Solution {public static int Stray(int[] numbers){return 0;} } 测试样例: using NU...