Write a method that returns the "partial sum" of an array of integers. So each position in the array that is returned will contain the sum of all the integers in the original array up to and including that position. Except, if a number is repeated consecutively, only count the first time it occurs in that batch of consecutive occurrences. If that number occurs again later (after the batch of consecutive occurrences) it will count as normal. For example: {5, 7, 3, 3, 3, 5, 5, 3, 7} will return {5, 12, 15, 15, 15, 20, 20, 23, 30} since the third and fourth 3's do not add to the running total because they are part of a consecutive batch of 3's. The 3rd 5 is also not added. But the 3 after the two 5's IS added since it is not part of a batch. Look at the test data for further examples.