{"id":9605,"date":"2022-04-02T14:46:58","date_gmt":"2022-04-02T21:46:58","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9605"},"modified":"2022-04-02T15:17:51","modified_gmt":"2022-04-02T22:17:51","slug":"leetcode-2221-find-triangular-sum-of-an-array","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-2221-find-triangular-sum-of-an-array\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2221. Find Triangular Sum of an Array"},"content":{"rendered":"\n

You are given a 0-indexed<\/strong> integer array nums<\/code>, where nums[i]<\/code> is a digit between 0<\/code> and 9<\/code> (inclusive<\/strong>).<\/p>\n\n\n\n

The triangular sum<\/strong> of nums<\/code> is the value of the only element present in nums<\/code> after the following process terminates:<\/p>\n\n\n\n

  1. Let nums<\/code> comprise of n<\/code> elements. If n == 1<\/code>, end<\/strong> the process. Otherwise, create<\/strong> a new 0-indexed<\/strong> integer array newNums<\/code> of length n - 1<\/code>.<\/li>
  2. For each index i<\/code>, where 0 <= i < n - 1<\/code>, assign<\/strong> the value of newNums[i]<\/code> as (nums[i] + nums[i+1]) % 10<\/code>, where %<\/code> denotes modulo operator.<\/li>
  3. Replace<\/strong> the array nums<\/code> with newNums<\/code>.<\/li>
  4. Repeat<\/strong> the entire process starting from step 1.<\/li><\/ol>\n\n\n\n

    Return the triangular sum of<\/em> nums<\/code>.<\/p>\n\n\n\n

    Example 1:<\/strong><\/p>\n\n\n\n

    \"\"\/<\/figure>\n\n\n\n
    Input:<\/strong> nums = [1,2,3,4,5]\nOutput:<\/strong> 8\nExplanation:<\/strong>\nThe above diagram depicts the process from which we obtain the triangular sum of the array.<\/pre>\n\n\n\n
    Example 2:<\/strong><\/p>\n\n\n\n
    Input:<\/strong> nums = [5]\nOutput:<\/strong> 5\nExplanation:<\/strong>\nSince there is only one element in nums, the triangular sum is the value of that element itself.<\/pre>\n\n\n\n
    Constraints:<\/strong><\/p>\n\n\n\n
    • 1 <= nums.length <= 1000<\/code><\/li>
    • 0 <= nums[i] <= 9<\/code><\/li><\/ul>\n\n\n\n
      Solution 1: Simulation<\/p>\n\n\n\n
      Time complexity: O(n2<\/sup>)
      Space complexity: O(n)<\/p>\n\n\n\n
      \n
      C++<\/h2>\n
      \n\n
      \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int triangularSum(vector& nums) {\n    while (nums.size() != 1) {\n      vector next(nums.size() - 1);\n      for (size_t i = 0; i < nums.size() - 1; ++i)\n        next[i] = (nums[i] + nums[i + 1]) % 10;\n      swap(next, nums);\n    }\n    return nums[0];\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
      You are given a 0-indexed integer array nums, where nums[i] is a digit between 0 and 9 (inclusive). The triangular sum of nums is the value of the only element present in nums after the following process terminates: Let nums comprise of n elements.…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[20,177,179],"class_list":["post-9605","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-array","tag-medium","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9605","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=9605"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9605\/revisions"}],"predecessor-version":[{"id":9607,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9605\/revisions\/9607"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9605"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9605"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9605"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}