Runtime: 404 ms (Top 62.14%) | Memory: 18.6 MB (Top 88.13%)

AnasImloul · AnasImloul · commit cbe4a8601d38 · 2022-08-31T22:50:56.000+01:00
diff --git a/scripts/algorithms/F/Find Triangular Sum of an Array/Find Triangular Sum of an Array.cpp b/scripts/algorithms/F/Find Triangular Sum of an Array/Find Triangular Sum of an Array.cpp
@@ -1,10 +1,11 @@
+// Runtime: 404 ms (Top 62.14%) | Memory: 18.6 MB (Top 88.13%)
 class Solution {
 public:
     int triangularSum(vector<int>& nums) {
         int n=nums.size();
         for(int i=n-1;i>=1;i--){
             for(int j=0;j<i;j++){
-                nums[j]=(nums[j]+nums[j+1])%10;                
+                nums[j]=(nums[j]+nums[j+1])%10;
             }
         }
         return nums[0];

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
	`1`	`+// Runtime: 404 ms (Top 62.14%) \| Memory: 18.6 MB (Top 88.13%)`
`1`	`2`	`class Solution {`
`2`	`3`	`public:`
`3`	`4`	`int triangularSum(vector<int>& nums) {`
`4`	`5`	`int n=nums.size();`
`5`	`6`	`for(int i=n-1;i>=1;i--){`
`6`	`7`	`for(int j=0;j<i;j++){`
`7`		`- nums[j]=(nums[j]+nums[j+1])%10;`
	`8`	`+ nums[j]=(nums[j]+nums[j+1])%10;`
`8`	`9`	`}`
`9`	`10`	`}`
`10`	`11`	`return nums[0];`