Java | Leetcode Java题解之第228题汇总区间
题目:
题解:
class Solution {
public List<String> summaryRanges(int[] nums) {
List<String> ans = new ArrayList<>();
for (int i = 0, j, n = nums.length; i < n; i = j + 1) {
j = i;
while (j + 1 < n && nums[j + 1] == nums[j] + 1) {
++j;
}
ans.add(f(nums, i, j));
}
return ans;
}
private String f(int[] nums, int i, int j) {
return i == j ? nums[i] + "" : String.format("%d->%d", nums[i], nums[j]);
}
}
原文地址:https://blog.csdn.net/m0_57195758/article/details/140339646
免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!