Add solution for problem 165

BigEgg · BigEgg · commit e99d8f1b88a4 · 2020-09-21T18:14:02.000-07:00
diff --git a/LeetCode.Test/0151-0200/0165-CompareVersionNumbers-Test.cs b/LeetCode.Test/0151-0200/0165-CompareVersionNumbers-Test.cs
@@ -0,0 +1,48 @@
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace LeetCode.Test
+{
+    [TestClass]
+    public class _0165_CompareVersionNumbers_Test
+    {
+        [TestMethod]
+        public void CompareVersion_1()
+        {
+            var solution = new _0165_CompareVersionNumbers();
+            var result = solution.CompareVersion("1.01", "1.001");
+            Assert.AreEqual(0, result);
+        }
+
+        [TestMethod]
+        public void CompareVersion_2()
+        {
+            var solution = new _0165_CompareVersionNumbers();
+            var result = solution.CompareVersion("1.0", "1.0.0");
+            Assert.AreEqual(0, result);
+        }
+
+        [TestMethod]
+        public void CompareVersion_3()
+        {
+            var solution = new _0165_CompareVersionNumbers();
+            var result = solution.CompareVersion("0.1", "1.1");
+            Assert.AreEqual(-1, result);
+        }
+
+        [TestMethod]
+        public void CompareVersion_4()
+        {
+            var solution = new _0165_CompareVersionNumbers();
+            var result = solution.CompareVersion("1.0.1", "1");
+            Assert.AreEqual(1, result);
+        }
+
+        [TestMethod]
+        public void CompareVersion_5()
+        {
+            var solution = new _0165_CompareVersionNumbers();
+            var result = solution.CompareVersion("7.5.2.4", "7.5.3");
+            Assert.AreEqual(-1, result);
+        }
+    }
+}
diff --git a/LeetCode.Test/LeetCode.Test.csproj b/LeetCode.Test/LeetCode.Test.csproj
@@ -205,6 +205,7 @@
     <Compile Include="0151-0200\0159-LongestSubstringWithAtMostTwoDistinctCharacters-Test.cs" />
     <Compile Include="0151-0200\0160-IntersectionOfTwoLinkedLists-Test.cs" />
     <Compile Include="0151-0200\0162-FindPeakElement-Test.cs" />
+    <Compile Include="0151-0200\0165-CompareVersionNumbers-Test.cs" />
     <Compile Include="0151-0200\0166-FractionToRecurringDecimal-Test.cs" />
     <Compile Include="0151-0200\0167-TwoSumII-Test.cs" />
     <Compile Include="0151-0200\0168-ExcelSheetColumnTitle-Test.cs" />
diff --git a/LeetCode/0151-0200/0165-CompareVersionNumbers.cs b/LeetCode/0151-0200/0165-CompareVersionNumbers.cs
@@ -0,0 +1,32 @@
+//-----------------------------------------------------------------------------
+// Runtime: 72ms
+// Memory Usage: 22.6 MB
+// Link: https://leetcode.com/submissions/detail/393499359/
+//-----------------------------------------------------------------------------
+
+using System;
+
+namespace LeetCode
+{
+    public class _0165_CompareVersionNumbers
+    {
+        public int CompareVersion(string version1, string version2)
+        {
+            var nums1 = version1.Split(new char[] { '.' });
+            var nums2 = version2.Split(new char[] { '.' });
+
+            var length1 = nums1.Length;
+            var length2 = nums2.Length;
+
+            for (int i = 0; i < Math.Max(length1, length2); i++)
+            {
+                var current1 = i < length1 ? int.Parse(nums1[i]) : 0;
+                var current2 = i < length2 ? int.Parse(nums2[i]) : 0;
+                if (current1 != current2)
+                    return current1 > current2 ? 1 : -1;
+            }
+
+            return 0;
+        }
+    }
+}
diff --git a/LeetCode/LeetCode.csproj b/LeetCode/LeetCode.csproj
@@ -195,6 +195,7 @@
     <Compile Include="0151-0200\0159-LongestSubstringWithAtMostTwoDistinctCharacters.cs" />
     <Compile Include="0151-0200\0160-IntersectionOfTwoLinkedLists.cs" />
     <Compile Include="0151-0200\0162-FindPeakElement.cs" />
+    <Compile Include="0151-0200\0165-CompareVersionNumbers.cs" />
     <Compile Include="0151-0200\0166-FractionToRecurringDecimal.cs" />
     <Compile Include="0151-0200\0167-TwoSumII.cs" />
     <Compile Include="0151-0200\0168-ExcelSheetColumnTitle.cs" />
diff --git a/README.md b/README.md
@@ -1,5 +1,5 @@
 [![AppVeyor Build Status](https://img.shields.io/appveyor/build/bigegg/leetcode-cs?label=Windows%20Build%20Status&logo=AppVeyor&style=flat-square)](https://ci.appveyor.com/project/BigEgg/leetcode-cs)
-[![Solved Problems](https://img.shields.io/badge/Solved%20Problems-810-blue.svg?style=flat-square)](https://github.com/BigEggStudy/LeetCode-CS)
+[![Solved Problems](https://img.shields.io/badge/Solved%20Problems-811-blue.svg?style=flat-square)](https://github.com/BigEggStudy/LeetCode-CS)
 
 # LeetCode
 The C# solutions for LeetCode problems.
@@ -214,6 +214,7 @@ The C# solutions for LeetCode problems.
 | 159 | Longest Substring with At Most Two Distinct Characters | [C#](./LeetCode/0151-0200/0159-LongestSubstringWithAtMostTwoDistinctCharacters.cs)(72ms) | O(N) | O(1) | |
 | 160 | Intersection of Two Linked Lists | [C#](./LeetCode/0151-0200/0160-IntersectionOfTwoLinkedLists.cs)(116ms) | O(N+M) | O(1) | |
 | 162 | Find Peak Element | [C#](./LeetCode/0151-0200/0162-FindPeakElement.cs)(92ms) | O(LogN) | O(1) | |
+| 165 | Compare Version Numbers | [C#](./LeetCode/0151-0200/0165-CompareVersionNumbers.cs)(72ms) | O(N+M) | O(N+M) | |
 | 166 | Fraction to Recurring Decimal | [C#](./LeetCode/0151-0200/0166-FractionToRecurringDecimal.cs)(76ms) | O(N) | O(N) | |
 | 167 | Two Sum II - Input array is sorted | [C#](./LeetCode/0151-0200/0167-TwoSumII.cs)(244ms) | O(N) | O(1) | |
 | 168 | Excel Sheet Column Title | [C#](./LeetCode/0151-0200/0168-ExcelSheetColumnTitle.cs)(68ms) | O(logN) | O(1) | |
