public void SingleNumber_GetNumberEdge_ReturnsExpectedNumber()
        {
            var nums = new[] { 2, 2, 1 };

            var singleNumber = new SingleNumber();

            Assert.That(singleNumber.GetNumber(nums), Is.EqualTo(1));
        }
        public void SingleNumber_OneNumberInList_ReturnsThatNumber()
        {
            var nums = new[] { 1 };

            var singleNumber = new SingleNumber();

            Assert.That(singleNumber.GetNumber(nums), Is.EqualTo(1));
        }
        public void SingleNumber_GetNumber_ReturnsExpectedNumber()
        {
            var nums = new[] { 1, 1, 2, 2, 3, 4, 4 };

            var singleNumber = new SingleNumber();

            Assert.That(singleNumber.GetNumber(nums), Is.EqualTo(3));
        }
Example #4
0
        public void GetSingleNumber_WhenCalled_ReturnItemThatExistOneAtArray(int[] nums, int expected)
        {
            var helper = new SingleNumber();

            var result = helper.GetSingleNumber(nums);

            Assert.That(result, Is.EqualTo(expected));
        }
        public void SingleNumber_AllNumbersHaveAPair_InvalidOperationExceptionIsThrown()
        {
            var nums = new[] { 1, 1, 2, 2 };

            var singleNumber = new SingleNumber();

            Assert.That(() => singleNumber.GetNumber(nums), Throws.TypeOf <InvalidOperationException>());
        }
Example #6
0
        public void Excution1Test()
        {
            var func = new SingleNumber();

            Assert.AreEqual(1, func.Excution1(new[] { 1 }));
            Assert.AreEqual(1, func.Excution1(new[] { 2, 2, 1 }));
            Assert.AreEqual(4, func.Excution1(new[] { 4, 1, 2, 1, 2 }));
            Assert.AreEqual(4, func.Excution1(new[] { 1, 2, 1, 2, 4 }));
        }
Example #7
0
        public void SingleNumberShouldFindUniqueElementInArray_Testcase_1()
        {
            // Arrange
            var inputArray = new int[] { 3, 8, 8, 15, 15, 56, 56, 98, 98 };

            // Act
            int uniqueNumberInArray = SingleNumber.FindUnique(inputArray);

            // Assert
            Assert.AreEqual(3, uniqueNumberInArray);
        }
Example #8
0
        public void SingleNumberShouldFindUniqueElementInArray_Testcase_3()
        {
            // Arrange
            var inputArray = new int[] { 9, 9, 20, 20, 25, 25, 30, 30, 71, 71, 122, 122, 150, 150 };

            // Act
            int uniqueNumberInArray = SingleNumber.FindUnique(inputArray);

            // Assert
            Assert.AreEqual(0, uniqueNumberInArray);
        }
Example #9
0
        public void singleNumberTest()
        {
            var s = new SingleNumber();

            Assert.AreEqual(1, s.singleNumber(new[] { 2, 2, 1 }));
            Assert.AreEqual(1, s.singleNumber(new[] { 1 }));
            Assert.AreEqual(-1, s.singleNumber(new[] { -1 }));
            Assert.AreEqual(-2, s.singleNumber(new[] { -1, -1, -2 }));
            Assert.AreEqual(0, s.singleNumber(new[] { 1, 0, 1 }));
            Assert.AreEqual(-1, s.singleNumber(new[] { 1, 3, 1, -1, 3 }));
            Assert.AreEqual(123456789, s.singleNumber(new[] { 123456789, 836133896, 65475264, 836133896, 746254373, 1000000000, 542627588, 1000000000, 444088605, 65475264, 746254373, 542627588, 444088605 }));
        }
Example #10
0
 public List <int> DrawLottoLine()
 {
     try
     {
         int temp;
         for (int i = 0; i < AmountOfNumbers; i++)
         {
             temp = SingleNumber.Next(1, NumberScale);
             LottoLine.Add(temp);
         }
         LottoLine.Sort();
         if (StarNumbers)
         {
             LottoLine.Add(SingleNumber.Next(1, 10));
             LottoLine.Add(SingleNumber.Next(1, 10));
         }
         return(LottoLine);
     }
     catch (Exception ex)
     {
         throw ex;
     }
 }
Example #11
0
    public void setNumber(int n)
    {
        List <int> numbers = new List <int>();

        if (n == 0)
        {
            numbers.Add(0);
        }
        else
        {
            while (n != 0)
            {
                numbers.Add(n % 10);
                n /= 10;
            }
        }

        drawList.Clear();
        sum = 0.0f;
        for (int i = numbers.Count - 1; i >= 0; --i)
        {
            int          num = numbers[i];
            SingleNumber sn  = new SingleNumber(materials[num]);
            drawList.Add(sn);
            sum += materials[num].mainTexture.width;
        }

        if (align == Align.CENTER)
        {
            sum /= 2;
        }
        else if (align == Align.LEFT)
        {
            sum = 0;
        }
    }
Example #12
0
        void InternalTest(int[] nums, int expected)
        {
            int actual = SingleNumber.Solve(nums);

            Assert.Equal <int>(expected, actual);
        }
Example #13
0
 public void SingleNumberTest(int expected, int[] nums)
 {
     Assert.Equal(expected, SingleNumber.Single(nums));
     Assert.Equal(expected, SingleNumber.SingleConstantMemory(nums));
 }
Example #14
0
 public void SingleNumber_Test()
 {
     Assert.IsTrue(SingleNumber.Find(new [] { 2, 2, 1 }) == 1);
 }
Example #15
0
 public void BeforeEach()
 {
     SingleNumber = new SingleNumber();
 }
Example #16
0
        static void Main(string[] args)
        {
            #region 1. Two Sum

            TwoSums twoSums = new TwoSums(new int[] { 2, 7, 11, 15 }, 18);
            twoSums.PrintExample();

            #endregion

            #region 3. LongestSubstringWithoutRepeatingCharacters

            LongestSubstringWithoutRepeatingCharacters longestSubstringWithoutRepeating = new LongestSubstringWithoutRepeatingCharacters("abcdecb");
            longestSubstringWithoutRepeating.PrintExample();

            #endregion

            #region 7. Reverse Integer

            ReverseInteger reverseInteger = new ReverseInteger(-54321);
            reverseInteger.PrintExample();

            #endregion

            #region 8. String to Integer (atoi)

            StringToInteger stringToInteger = new StringToInteger("  -42");
            stringToInteger.PrintExample();

            #endregion

            #region 9. Palindrome Number

            PalindromeNumber palindromeNumber = new PalindromeNumber(121);
            palindromeNumber.PrintExample();

            #endregion

            #region 20. Valid Parentheses

            ValidParentheses validParentheses = new ValidParentheses("(){[]}");
            validParentheses.PrintExample();

            #endregion

            #region 26. Remove Duplicates from Sorted Array

            RemoveDuplicatesFromSortedArray removeDuplicatesFromSortedArray = new RemoveDuplicatesFromSortedArray(new [] { 1, 2, 3, 3, 4, 5, 5, 5, 5, 5, 5, 6 });
            removeDuplicatesFromSortedArray.PrintExample();

            #endregion

            #region 35. Search Insert Position

            SearchInsertPosition searchInsertPosition = new SearchInsertPosition(new [] { 1, 3, 5, 10 }, 9);
            searchInsertPosition.PrintExample();

            #endregion

            #region 58. Length of Last Word

            LengthOfLastWord lengthOfLastWord = new LengthOfLastWord("Hello World");
            lengthOfLastWord.PrintExample();

            #endregion

            #region 104. Maximum Depth of Binary Tree



            #endregion

            #region 125. Valid Palindrome

            ValidPalindrome validPalindrome = new ValidPalindrome("A man, a plan, a canal: Panama");
            validPalindrome.PrintExample();

            #endregion

            #region 136. Single Number

            SingleNumber singleNumber = new SingleNumber(new [] { 2, 2, 3, 3, 1 });
            singleNumber.PrintExample();

            #endregion

            #region 150. Evaluate Reverse Polish Notation

            EvaluateReversePolishNotation evaluateReversePolishNotation = new EvaluateReversePolishNotation(new [] { "2", "1", "+", "3", "*" });
            evaluateReversePolishNotation.PrintExample();

            #endregion

            #region 155. Min Stack

            MinStack minStack = new MinStack();
            minStack.PrintExample();

            #endregion

            #region 167. Two Sum II - Input array is sorted

            TwoSumII twoSumII = new TwoSumII(new [] { 1, 2, 3, 7 }, 10);
            twoSumII.PrintExample();

            #endregion

            #region 200. Number of Islands

            NumberOfIslands numberOfIslands = new NumberOfIslands(new char[, ]
            {
                { '1', '1', '0', '0', '0' },
                { '1', '1', '0', '0', '0' },
                { '0', '0', '1', '0', '0' },
                { '0', '0', '0', '1', '1' }
            });
            numberOfIslands.PrintExample();

            #endregion

            #region 217. Contains Duplicate

            ContainsDuplicate containsDuplicate = new ContainsDuplicate(new [] { 1, 2, 3, 1 });
            containsDuplicate.PrintExample();

            #endregion

            #region 268. Missing Number

            MissingNumber missingNumber = new MissingNumber(new [] { 9, 6, 4, 2, 3, 5, 7, 0, 1 });
            missingNumber.PrintExample();

            #endregion

            #region 344. Reverse String

            ReverseString reverseString = new ReverseString("A man with a plan");
            reverseString.PrintExample();

            #endregion

            #region 387. First Unique Character in a String

            FirstUniqueCharacterInAString firstUniqueChar = new FirstUniqueCharacterInAString("loveleetcode");
            firstUniqueChar.PrintExample();

            #endregion

            #region 412. FizzBuzz

            FizzBuzz fizzBuzz = new FizzBuzz(15);
            fizzBuzz.PrintExample();

            #endregion

            #region 485. Max Consecutive Ones

            MaxConsecutiveOnes maxConsecutiveOnes = new MaxConsecutiveOnes(new int[] { 1, 1, 0, 1, 1, 1 });
            maxConsecutiveOnes.PrintExample();

            #endregion

            #region 509. Fibonacci Number

            FibonacciNumber fibonacciNumber = new FibonacciNumber(10);
            fibonacciNumber.PrintExample();

            #endregion

            #region 622. Design Circular Queue

            CircularQueue circularQueue = new CircularQueue(1);
            Console.WriteLine("622. Design Circular Queue");
            Console.WriteLine($"Front()   : {circularQueue.Front()}");
            Console.WriteLine($"IsEmpty() : {circularQueue.IsEmpty()}");
            circularQueue.EnQueue(1);
            Console.WriteLine($"EnQueue(1)");
            Console.WriteLine($"IsEmpty() : {circularQueue.IsEmpty()}");
            Console.WriteLine($"IsFull()  : {circularQueue.IsFull()}\n");

            #endregion

            #region 707. Design Linked List

            LinkedList linkedList = new LinkedList(new Node());
            linkedList.AddAtTail(10);
            linkedList.AddAtTail(20);
            linkedList.PrintLinkedList();

            #endregion

            #region 709. To Lower Case

            ToLowerCase toLowerCase = new ToLowerCase("LOVELY");
            toLowerCase.PrintExample();

            #endregion

            #region 739. Daily Temperatures

            DailyTemperatures dailyTemperatures = new DailyTemperatures(new [] { 89, 62, 70, 58, 47, 47, 46, 76, 100, 70 });
            dailyTemperatures.PrintExample();

            #endregion

            #region 747. Largest Number at Least Twice of Others

            LargestNumberAtLeastTwiceOfOthers largestNumberAtLeastTwiceOfOthers = new LargestNumberAtLeastTwiceOfOthers(new [] { 3, 6, 1, 0 });
            largestNumberAtLeastTwiceOfOthers.PrintExample();

            #endregion

            #region 771. Jewels and Stones
            string          j = "aA", s = "aAAbbbb";
            JewelsAndStones jewelsAndStones = new JewelsAndStones(j, s);
            jewelsAndStones.PrintExample();

            #endregion

            #region 832. Flipping an Image
            int[][] flippingImageArray      = new int[3][];
            flippingImageArray[0] = new int[] { 1, 1, 0 };
            flippingImageArray[1] = new int[] { 1, 0, 1 };
            flippingImageArray[2] = new int[] { 0, 0, 0 };
            FlippingAnImage flippingAnImage = new FlippingAnImage(flippingImageArray);
            flippingAnImage.PrintExample();

            #endregion

            #region 917. Reverse Only Letters

            ReverseOnlyLetters reverseOnlyLetters = new ReverseOnlyLetters("Qedo1ct-eeLg=ntse-T!");
            reverseOnlyLetters.PrintExample();

            #endregion


            Console.ReadLine();
        }
 public void SingleNumber_WhenGivenInputOfLength1_Returns_Expected()
 {
     Assert.AreEqual(25, SingleNumber.Solution(new int[] { 25 }));
 }
        public void SingleNumber_WhenGivenInput_ReturnsExpectedResult(int[] input, int result)
        {
            var actual = SingleNumber.Solution(input);

            Assert.AreEqual(result, actual);
        }
 public void SingleNumber_WhenNullInput_Returns_0()
 {
     Assert.AreEqual(0, SingleNumber.Solution(null));
 }
Example #20
0
        public int SingleNumber(int[] nums)
        {
            var number = new SingleNumber(nums);

            return(number.GetSingleNumber());
        }