Java for LeetCode 228 Summary Ranges

來源:互聯網
上載者:User

標籤:

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<String> list = new ArrayList<String>();if (nums.length == 0)return list;int left = nums[0], index = nums[0];for (int i = 1; i < nums.length; i++) {if (index == nums[i] - 1)index++;else if (index == left) {list.add(index + "");left = nums[i];index = nums[i];} else {list.add(left + "->" + index);left = nums[i];index = nums[i];}}if (index == left) list.add(index + "");else list.add(left + "->" + index);return list;    }

 

Java for LeetCode 228 Summary Ranges

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.