165

Cipher-vasu · Feb 25, 2022 · b87c029 · b87c029
1 parent c7bbec0
commit b87c029
Showing 1 changed file with 41 additions and 28 deletions.
diff --git a/leetcode/165. Compare Version Numbers/README.md b/leetcode/165. Compare Version Numbers/README.md
@@ -1,47 +1,60 @@
 # [165. Compare Version Numbers (Medium)](https://leetcode.com/problems/compare-version-numbers/)
 
-<p>Compare two version numbers <em>version1</em> and <em>version2</em>.<br>
-If <code><em>version1</em> &gt; <em>version2</em></code> return <code>1;</code>&nbsp;if <code><em>version1</em> &lt; <em>version2</em></code> return <code>-1;</code>otherwise return <code>0</code>.</p>
+<p>Given two version numbers,&nbsp;<code>version1</code> and <code>version2</code>, compare them.</p>
 
-<p>You may assume that the version strings are non-empty and contain only digits and the <code>.</code> character.</p>
-<p>The <code>.</code> character does not represent a decimal point and is used to separate number sequences.</p>
-<p>For instance, <code>2.5</code> is not "two and a half" or "half way to version three", it is the fifth second-level revision of the second first-level revision.</p>
-<p>You may assume the default revision number for each level of a version number to be <code>0</code>. For example, version number <code>3.4</code> has a revision number of <code>3</code> and <code>4</code> for its first and second level revision number. Its third and fourth level revision number are both <code>0</code>.</p>
+<ul>
+</ul>
 
-<p>&nbsp;</p>
+<p>Version numbers consist of <strong>one or more revisions</strong> joined by a dot&nbsp;<code>'.'</code>. Each revision&nbsp;consists of <strong>digits</strong>&nbsp;and may contain leading <strong>zeros</strong>. Every revision contains <strong>at least one character</strong>. Revisions are <strong>0-indexed from left to right</strong>, with the leftmost revision being revision 0, the next revision being revision 1, and so on. For example&nbsp;<code>2.5.33</code>&nbsp;and&nbsp;<code>0.1</code>&nbsp;are valid version numbers.</p>
 
-<p><strong>Example 1:</strong></p>
-<pre><strong>Input:</strong> <code><em>version1</em></code> = "0.1", <code><em>version2</em></code> = "1.1"
-<strong>Output:</strong> -1</pre>
+<p>To compare version numbers, compare their revisions in <strong>left-to-right order</strong>. Revisions are compared using their&nbsp;<strong>integer value ignoring any leading zeros</strong>. This means that revisions&nbsp;<code>1</code>&nbsp;and&nbsp;<code>001</code>&nbsp;are considered&nbsp;<strong>equal</strong>. If a version number does not specify a revision at an index, then&nbsp;<strong>treat the revision as&nbsp;<code>0</code></strong>. For example, version&nbsp;<code>1.0</code> is less than version&nbsp;<code>1.1</code>&nbsp;because their revision 0s are the same, but their revision 1s are&nbsp;<code>0</code>&nbsp;and&nbsp;<code>1</code>&nbsp;respectively, and&nbsp;<code>0 &lt; 1</code>.</p>
 
-<p><strong>Example 2:</strong></p>
-<pre><strong>Input: </strong><code><em>version1</em></code> = "1.0.1", <code><em>version2</em></code> = "1"
-<strong>Output:</strong> 1</pre>
+<p><em>Return the following:</em></p>
 
-<p><strong>Example 3:</strong></p>
-<pre><strong>Input:</strong> <code><em>version1</em></code> = "7.5.2.4", <code><em>version2</em></code> = "7.5.3"
-<strong>Output:</strong> -1</pre>
+<ul>
+	<li>If <code>version1 &lt; version2</code>, return <code>-1</code>.</li>
+	<li>If <code>version1 &gt; version2</code>, return <code>1</code>.</li>
+	<li>Otherwise, return <code>0</code>.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
 
-<p><strong>Example 4:</strong></p>
-<pre><strong>Input:</strong> <code><em>version1</em></code> = "1.01", <code><em>version2</em></code> = "1.001"
+<pre><strong>Input:</strong> version1 = "1.01", version2 = "1.001"
 <strong>Output:</strong> 0
-<strong>Explanation:</strong> Ignoring leading zeroes, both “01” and “001" represent the same number “1”</pre>
+<strong>Explanation:</strong> Ignoring leading zeroes, both "01" and "001" represent the same integer "1".
+</pre>
 
-<p><strong>Example 5:</strong></p>
-<pre><strong>Input:</strong> <code><em>version1</em></code> = "1.0", <code><em>version2</em></code> = "1.0.0"
+<p><strong>Example 2:</strong></p>
+
+<pre><strong>Input:</strong> version1 = "1.0", version2 = "1.0.0"
 <strong>Output:</strong> 0
-<strong>Explanation:</strong> The first version number does not have a third level revision number, which means its third level revision number is default to "0"</pre>
+<strong>Explanation:</strong> version1 does not specify revision 2, which means it is treated as "0".
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre><strong>Input:</strong> version1 = "0.1", version2 = "1.1"
+<strong>Output:</strong> -1
+<strong>Explanation:</strong> version1's revision 0 is "0", while version2's revision 0 is "1". 0 &lt; 1, so version1 &lt; version2.
+</pre>
 
 <p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= version1.length, version2.length &lt;= 500</code></li>
+	<li><code>version1</code> and <code>version2</code>&nbsp;only contain digits and <code>'.'</code>.</li>
+	<li><code>version1</code> and <code>version2</code>&nbsp;<strong>are valid version numbers</strong>.</li>
+	<li>All the given revisions in&nbsp;<code>version1</code> and <code>version2</code>&nbsp;can be stored in&nbsp;a&nbsp;<strong>32-bit integer</strong>.</li>
+</ul>
+
 
-<p><strong>Note:</strong></p>
-<ol>
-<li>Version strings are composed of numeric strings separated by dots <code>.</code> and this numeric strings <strong>may</strong> have leading zeroes. </li>
-<li>Version strings do not start or end with dots, and they will not be two consecutive dots.</li>
-</ol>
+**Companies**:  
+[Amazon](https://leetcode.com/company/amazon), [Microsoft](https://leetcode.com/company/microsoft), [Salesforce](https://leetcode.com/company/salesforce)
 
 **Related Topics**:  
-[String](https://leetcode.com/tag/string/)
+[Two Pointers](https://leetcode.com/tag/two-pointers/), [String](https://leetcode.com/tag/string/)
 
 ## Solution 1.