LeetCode 228: Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

代码要求对数组中的元素进行分段。

首先给出字符串格式化函数，假设begin==end，则输出字符串“begin”，否则输出“begin->end”,代码例如以下：

string format(int begin, int end){char buffer[32];if (end == begin){sprintf(buffer, "%d", begin);}else{sprintf(buffer, "%d->%d", begin, end);}return string(buffer);}

然后对数组进行分段。代码例如以下：

vector<string> summaryRanges(vector<int>& nums) {vector<string> result;if (nums.size()<1)return result;int begin, end;begin = end = nums[0];for (int i=1; i<nums.size(); i++){if (nums[i] ==end || nums[i]==end+1){end = nums[i];} else{result.push_back(format(begin, end));begin = end = nums[i];}}result.push_back(format(begin, end));return result;}

转载于:https://www.cnblogs.com/llguanli/p/6902648.html

LeetCode 228: Summary Ranges相关推荐

LeetCode 228. Summary Ranges
228. Summary Ranges Given a sorted integer array without duplicates, return the summary of its range ...
228. Summary Ranges
题目: Given a sorted integer array without duplicates, return the summary of its ranges. For example, ...
228 Summary Ranges 汇总区间
给定一个无重复元素的有序整数数组,返回数组中区间范围的汇总. 示例 1: 输入: [0,1,2,4,5,7] 输出: ["0->2","4->5", ...
LeetCode Summary Ranges(简单的数组处理)
Given a sorted integer array without duplicates, return the summary of its ranges. For example, g ...
leetcode解题笔记-Summary Ranges
题目要求: 给定一个排序好的int数组,按照间隔输出字符串个人解法: 1.设一个临时变量,用来存->后面的值, 2. 遍历一次数组,注意要判断是否到最后一位. 代码: public stati ...
Summary Ranges
https://leetcode.com/problems/summary-ranges/ Given a sorted integer array without duplicates, retur ...
leetcode 228. 汇总区间（Java版）
题目示例 1: 输入:nums = [0,1,2,4,5,7] 输出:["0->2","4->5","7"] 解释:区间范围是 ...
leetcode 228. 汇总区间
给定一个无重复元素的有序整数数组 nums . 返回恰好覆盖数组中所有数字的最小有序区间范围列表.也就是说,nums 的每个元素都恰好被某个区间范围所覆盖,并且不存在属于某个范围但不属于 nu ...
LeetCode解题报告汇总
LeetCode解题报告: [LeetCode]1.Two Sum - Yoona - 博客频道 - CSDN.NET [LeetCode]2.Add Two Numbers - Yoona - 博客 ...

LeetCode 228: Summary Ranges

LeetCode 228: Summary Ranges相关推荐

最新文章

热门文章