1C#.NET面试题(有答案).pdf

Reversea Singly Linked List without using Recursion. /// summary /// Revert a single linked list /// /summary /// param name roota single linked list/param /// returnsa single linked list/returns public static SingleLinkedListNode Reverse (SingleLinkedListNode root) { if (root null) throw new ArgumentNullException (root); SingleLinkedListNode iter root, next root.Next; SingleLinkedListNode newRoot root; root.Next null; while (next ! null) { newRoot next.Next; next.Next iter; iter next; next newRoot; } return iter; } Reversea Singly Linked List with using Recursion. 编程找出N 以下的所有素数 void findPrimes(bignum topCandidate) { bignum candidate 2; while (candidate topCandidate) { bignum trialDivisor 2; int prime 1; while (trialDivisor * trialDivisor candidate) { if(candidate % trialDivisor 0) { prime 0; break; } trialDivisor++; } if(prime) printPrime (candidate); candidate++; } } Reverse every wordin a String (abc def becomes cba fed). 1. private static string ReverseStringByWord (string input) 2. { 3. if (string.IsNullOrEmpty (input)) 4. throw new ArgumentNullException (input); 5. 6. char[] sb new char[input.Length]; 7. int lastIndex input.Length; 8. while ((lastIndex 0) char.IsWhiteSpace (input [lastIndex - 1])) lastIndex--; 9. 10. int appendIndex 0; 11. for (int i lastIndex - 1