2019獨(dú)角獸企業(yè)重金招聘Python工程師標(biāo)準(zhǔn)>>>

1.關(guān)于本博客的說明

Code Hunt 是我從CSDN上的一篇文章中無意間看到的：微軟研究院正式發(fā)布編程學(xué)習(xí)游戲Code Hunt，游戲地址從這里進(jìn)入。

本篇博客是游戲的?JAGGED ARRAYS 和 Arrays 2 部分的C#部分解題代碼

2.SECTOR10：JAGGED ARRAYS

1）SECTOR10-01

SKILL RATING：3

using?System; public?class?Program {public?static?int?Puzzle(int[][]?list,?int?i,?int?j){return?list[i][j];} }

2）SECTOR10-02

SKILL RATING：1

建立一個大小為5*5的矩陣，每個元素賦初值為0

using?System; public?class?Program {public?static?int[][]?Puzzle(){return?new?int[][]?{?new?int[5],?new?int[5],?new?int[5],?new?int[5],?new?int[5]?};} }

3）SECTOR10-03

建立一個大小為length*length的矩陣，每個元素賦初值為x

SKILL RATING：1

using?System; public?class?Program {public?static?int[][]?Puzzle(int?length,?int?x){int[]?array?=?new?int[length];for?(int?i?=?0;?i?<?array.Length;?i++){array[i]?=?x;?}int[][]?result?=?new?int[length][];for?(int?i?=?0;?i?<?result.Length;?i++){?result[i]?=?array;?}return?result;} }

4）SECTOR10-04

SKILL RATING：3

using?System; public?class?Program {public?static?int[][]?Puzzle(int[][]?input){int[][]?result?=?new?int[input.Length][];for?(int?i?=?0;?i?<?result.Length;?i++){result[i]?=?new?int[input[i].Length];for?(int?j?=?0;?j?<?result[i].Length;?j++){result[i][j]?=?input[i][j]?*?2;}}return?result;} }

SKILL RATING：?

using?System; public?class?Program {public?static?int[][]?Puzzle(int[][]?input){for?(int?i?=?0;?i?<?input.Length;?i++){for?(int?j?=?0;?j?<?input[i].Length;?j++){input[i][j]?*=?2;}}return?input;} }

5）SECTOR10-05

找出數(shù)組input中等于i的元素個數(shù)

SKILL RATING：3

using?System; public?class?Program {public?static?int?Puzzle(int[][]?input,?int?i){int?counter?=?0;for?(int?x?=?0;?x?<?input.Length;?x++){for?(int?y?=?0;?y?<?input[x].Length;?y++){if?(input[x][y]?==?i){counter++;}}}return?counter;} }

6）SECTOR10-06

SKILL RATING：1

using?System; public?class?Program {public?static?int?Puzzle(int[][]?input){int?max?=?int.MinValue;for?(int?x?=?0;?x?<?input.Length;?x++){for?(int?y?=?0;?y?<?input[x].Length;?y++){if?(input[x][y]?>?max){max?=?input[x][y];}}}return?max;} }

7）SECTOR10-07

找到鋸齒型數(shù)組中和最大的一個元素數(shù)組

SKILL RATING：2

using?System; public?class?Program {public?static?int[]?Puzzle(int[][]?input){int?maxsum?=?int.MinValue;int?arrsum?=?0;int?isign?=?0;for?(int?i?=?0;?i?<?input.Length;?i++){arrsum?=?0;for?(int?j?=?0;?j?<?input[i].Length;?j++){arrsum?+=?input[i][j];}if?(arrsum?>?maxsum){maxsum?=?arrsum;isign?=?i;}}return?input[isign];} }

8）SECTOR10-08

找出二維數(shù)組各列中元素總和最大的列，并輸出該列各元素和

SKILL RATING：2

using?System; public?class?Program {public?static?int?Puzzle(int[][]?input){int[]?arrsum?=?new?int[input[0].Length];int?sum?=?0;for?(int?i?=?0;?i?<?input[0].Length;?i++){sum?=?0;for?(int?j?=?0;?j?<?input.Length;?j++){sum?+=?input[j][i];}arrsum[i]?=?sum;}int?max?=?int.MinValue;int?sign?=?0;for?(int?x?=?0;?x?<?arrsum.Length;?x++){if?(arrsum[x]?>?max){max?=?arrsum[x];sign?=?x;}}return?arrsum[sign];} }

SKILL RATING：3

using?System; public?class?Program {public?static?int?Puzzle(int[][]?input){int?max?=?int.MinValue;int?sum?=?0;for?(int?i?=?0;?i?<?input[0].Length;?i++){sum?=?0;for?(int?j?=?0;?j?<?input.Length;?j++){sum?+=?input[j][i];}if?(max?<?sum){max?=?sum;}}return?max;} }

2.SECTOR11：ARRAYS 2

1）SECTOR11-01

兩個數(shù)組 a,b 生成一個新的數(shù)組 c
c[i]=a[i]-b[i] (i<a、b的長度，且a[i]>=b[i])
c[i]=b[i]-a[i] (i<a、b的長度，且a[i]<b[i])
c[i]=0-b[i] (i>=a的長度且i<b的長度)
c[i]=a[i]-0 (i>=b的長度且i<a的長度)

SKILL RATING：1

using?System; public?class?Program {public?static?int[]?Puzzle(int[]?a,?int[]?b){int[]?c?=?new?int[a.Length?>=?b.Length???a.Length?:?b.Length];for?(int?i?=?0;?i?<?c.Length;?i++){if?(i?<?a.Length?&&?i?<?b.Length){c[i]?=?a[i]?>=?b[i]???a[i]?-?b[i]?:?b[i]?-?a[i];}else?if?(i?>=?a.Length?&&?i?<?b.Length){c[i]?=?0?-?b[i];}else{c[i]?=?a[i]?-?0;}}return?c;} }

2）SECTOR11-02

將一個數(shù)組中每個元素復(fù)制一個放在自己后面，生成一個新數(shù)組

{"", "a"} → {"", "", "a", "a"}

SKILL RATING：2

using?System; public?class?Program {public?static?string[]?Puzzle(string[]?a,?int?amount){string[]?s?=?new?string[a.Length?*?amount];for?(int?i?=?0;?i?<?a.Length;?i++){for?(int?j?=?0;?j?<?amount;?j++){s[amount?*?i?+?j]?=?a[i];}}return?s;} }

3）SECTOR11-03

一個二維方陣，判斷兩個對角線元素和是否相等

SKILL RATING：3

using?System; public?class?Program {public?static?bool?Puzzle(int[][]?input){int?sum1?=?0,?sum2?=?0;for?(int?i?=?0;?i?<?input.Length;?i++){sum1?+=?input[i][i];sum2?+=?input[i][input.Length?-?1?-?i];}return?sum1?==?sum2???true?:?false;} }

4）SECTOR11-04

SKILL RATING：3

using?System; public?class?Program {public?static?int[]?Puzzle(int[]?list,?int?modBy){for?(int?i?=?0;?i?<?list.Length;?i++){list[i]?%=?modBy;}return?list;} }

5）SECTOR11-05

SKILL RATING：2

using?System; public?class?Program?{public?static?string[]?Puzzle(string[]?list)?{string[]?result?=?new?string[(list.Length+1)/2];for(int?i=0;i<result.Length-1;i++){result[i]=list[i*2]+list[i*2+1];}result[result.Length-1]?=?(list.Length%2==0)?(list[list.Length-2]+list[list.Length-1]):(list[list.Length-1]);return?result;} }

6）SECTOR11-06

SKILL RATING：3

using?System; public?class?Program {public?static?string[]?Puzzle(int[]?grades,?int?A,?int?B,?int?C,?int?D){string[]?sgrades?=?new?string[grades.Length];for?(int?i?=?0;?i?<?grades.Length;?i++){sgrades[i]?=?(grades[i]?>=?A???"A"?:?(grades[i]?>=?B???"B"?:?(grades[i]?>=?C???"C"?:?(grades[i]?>=?D???"D"?:?"E"))));}return?sgrades;} }

7）SECTOR11-07

SKILL RATING：3

using?System; public?class?Program {public?static?string[][]?Puzzle(string[][]?input){string?temp;for?(int?i?=?0;?i?<?input.Length;?i++){for?(int?j?=?i;?j?<?input[i].Length;?j++){temp?=?input[i][j];input[i][j]?=?input[j][i];input[j][i]?=?temp;}}return?input;} }

轉(zhuǎn)載于:https://my.oschina.net/Tsybius2014/blog/267576

總結(jié)

以上是生活随笔為你收集整理的Code Hunt SECTOR 10 - 11（Jagged Arrays Arrays 2）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。