LeetCode 228 Summary Ranges

最新推荐文章于 2023-04-23 15:02:13 发布

yaoyuan-yy

最新推荐文章于 2023-04-23 15:02:13 发布

阅读量293

点赞数

本文链接：https://blog.csdn.net/YYecust/article/details/52059971

版权

在末尾加一个INF
巧妙解决所有问题

class Solution {
public:
  vector<string> ans;
  string summary(int l, int r) {
    stringstream ss;
    string t;
    if (l == r) {
      ss << l;
      ss >> t;
    } else {
      ss << l;
      ss << "->";
      ss << r;
      ss >> t;
    }
    return t;
  }
  vector<string> summaryRanges(vector<int>& nums) {
    int INF = INT_MAX;
    nums.push_back(INF);
    int l = nums[0], r;
    for (int i = 1; i < nums.size(); i++) {
      if (nums[i] != nums[i - 1] + 1) {
        r = nums[i - 1];
        ans.push_back(summary(l, r));
        l = nums[i];
      }
    }
    return ans;
  }
};