{"id":6929,"date":"2020-06-14T19:35:57","date_gmt":"2020-06-15T02:35:57","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=6929"},"modified":"2020-06-14T19:36:17","modified_gmt":"2020-06-15T02:36:17","slug":"leetcode-1480-running-sum-of-1d-array","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode-1480-running-sum-of-1d-array\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1480. Running Sum of 1d Array"},"content":{"rendered":"\n<p>Given an array&nbsp;<code>nums<\/code>. We define a running sum of an array as&nbsp;<code>runningSum[i] = sum(nums[0]\u2026nums[i])<\/code>.<\/p>\n\n\n\n<p>Return the running sum of&nbsp;<code>nums<\/code>.<\/p>\n\n\n\n<p><strong>Example 1:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [1,2,3,4]\n<strong>Output:<\/strong> [1,3,6,10]\n<strong>Explanation:<\/strong> Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].<\/pre>\n\n\n\n<p><strong>Example 2:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [1,1,1,1,1]\n<strong>Output:<\/strong> [1,2,3,4,5]\n<strong>Explanation:<\/strong> Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].<\/pre>\n\n\n\n<p><strong>Example 3:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [3,1,2,10,1]\n<strong>Output:<\/strong> [3,4,6,16,17]\n<\/pre>\n\n\n\n<p><strong>Constraints:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><code>1 &lt;= nums.length &lt;= 1000<\/code><\/li><li><code>-10^6&nbsp;&lt;= nums[i] &lt;=&nbsp;10^6<\/code><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Solution<\/strong><\/h2>\n\n\n\n<p>Time complexity: O(n)<br>Space complexity: O(1)<\/p>\n\n\n\n<div class=\"responsive-tabs\">\n<h2 class=\"tabtitle\">C++<\/h2>\n<div class=\"tabcontent\">\n\n<pre lang=\"C++\">\n\/\/ Author: Huahua\nclass Solution {\npublic:\n  vector<int> runningSum(vector<int>& nums) {\n    vector<int> ans(nums);\n    for (int i = 1; i < ans.size(); ++i)\n      ans[i] += ans[i - 1];\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Given an array&nbsp;nums. We define a running sum of an array as&nbsp;runningSum[i] = sum(nums[0]\u2026nums[i]). Return the running sum of&nbsp;nums. Example 1: Input: nums = [1,2,3,4]&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184],"tags":[20,222,200],"class_list":["post-6929","post","type-post","status-publish","format-standard","hentry","category-array","tag-array","tag-easy","tag-prefix-sum","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6929","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=6929"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6929\/revisions"}],"predecessor-version":[{"id":6931,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6929\/revisions\/6931"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=6929"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=6929"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=6929"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}