Back to course home
0% completed
Vote For New Content
C#: O(1) space better than Official solution
KP K
Jul 31, 2024
using System; public class Solution { public int[] findDifferenceArray(int[] nums) { int n = nums.Length; int[] differenceArray = new int[n]; int ls=0, rs=0; for(int i=0;i<nums.Length;i++){ rs+=nums[i]; } for(int i=0;i<nums.Length;i++){ rs-=nums[i]; differenceArray[i]=Math.Abs(rs-ls); ls+=nums[i]; } return differenceArray; } }
0
0
Comments
Comments
On this page
Problem Statement
Examples
Solution
Step-by-step Algorithm
Algorithm Walkthrough
Code
Complexity Analysis
Time Complexity
Space Complexity