Maximum circular subarray sum

Can somebody give it’s solution with proper explanation
Given n numbers (both +ve and -ve), arranged in a circle, find the maximum sum of consecutive numbers.

One possible idea: double the array and use the usual greedy algorithm for this array. You have to take care not to have a sum with more elements than the initial array.