165. Compare Version Numbers LeetCode
2016-02-13 16:29
302 查看
题意：比较版本。
题解：比较麻烦的就是获取每一级的数字。这里用istringstream来处理会方便很多。
题解：比较麻烦的就是获取每一级的数字。这里用istringstream来处理会方便很多。
class Solution {
public:
int compareVersion(string version1, string version2) {
istringstream s1(version1 + "."), s2(version2 + ".");
char dot = '.';
int val1,val2;
while(1)
{
void *p1 = (s1>>val1>>dot),*p2 = (s2>>val2>>dot);
if(!p1 && !p2) return 0;
if(!p1) val1 = 0;
if(!p2) val2 = 0;
if(val1 < val2) return -1;
else if(val1 > val2) return 1;
}
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解