[LeetCode][JavaScript]Summary Ranges

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"].

https://leetcode.com/problems/summary-ranges/



简单的模拟题,合并连续的数字,test case排过序而且不会重复。

 1 /**
 2  * @param {number[]} nums
 3  * @return {string[]}
 4  */
 5 var summaryRanges = function(nums) {
 6     var result = [];
 7     var start = null;
 8     for(var i = 0; i < nums.length; i++){
 9         if(start === null){
10             if(!nums[i + 1] || nums[i + 1] - nums[i] !== 1){
11                 result.push(nums[i] + "");
12             }else{
13                 start = nums[i];
14             }
15         }else if(!nums[i + 1] || nums[i + 1] - nums[i] !== 1){
16             result.push(start + "->" + nums[i]);
17             start = null;
18         }
19     }
20     return result;
21 };
时间: 2024-08-09 02:01:04

[LeetCode][JavaScript]Summary Ranges的相关文章

LeetCode:Summary Ranges - 获取数组中数字的范围

1.题目名称 Summary Ranges(获取数组中数字的范围) 2.题目地址 https://leetcode.com/problems/summary-ranges/ 3.题目内容 英文:Given a sorted integer array without duplicates, return the summary of its ranges. 中文:给出一个整数数组,返回这个数组中数字的范围 例如:给出数组 [0,1,2,4,5,7],返回 ["0->2",&quo

[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"]. 代码 /*--------------------------------------- * 日期:2015-08-04 * 作者:SJF01

Java for 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"]. 解题思路: JAVA实现如下: public List<String> summaryRanges(int[] nums) { List

[LeetCode]8. 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"]. 解法:(1)初始化两个游标ind1=0,ind2=1,一个左边界left=ind1:(2)若nums[ind2]-nums[ind1]==1则ind

leetcode: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"]. Credits:Special thanks to @jianchao.li.fighter for adding this problem and

【LeetCode】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"]. 意:找出排序数组(无重复数字)中的各个连续的范围 算法思想 基本思想如下,给定排序数组 N<a1,a2,a3,...,an>,

leetCode(50):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"]. 本题我采用的是最直观的算法,但整数转化为字符还有些坎坷.应该还有简单的算法,但目前没有时间去研究了. class Solution { public

[LeetCode] 163. Missing Ranges 缺失区间

Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper], return its missing ranges. Example: Input: nums = [0, 1, 3, 50, 75], lower = 0 and upper = 99,Output: ["2", "4->49", "51-

[LeetCode][JavaScript]Pascal&#39;s Triangle

Pascal's Triangle Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] https://leetcode.com/problems/pascals-triangle/ 杨辉三角. 每行第一个和最后一个是1,其余是pre[i - 1] +