<commit_before><commit_msg>maxSubArray<commit_after>class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int n = nums.size();
        if(n == 0)
            return 0;
        if(n == 1)
            return nums[0];
        int max = 0x80000001;
        int sum = 0;
        for(int i =0;i<n;++i){
            for(int j=0;j<n;++j){
                sum = 0;
                for(int k=i;k<=j;++k){
                    sum += nums[k];
                }
                if(sum > max)
                    max = sum;
            }
        }
        return max;
    }
};
{'fraction_non_alphanumeric': 0.140893470790378, 'fraction_numerical': 0.029209621993127148, 'mean_word_length': 1.0747330960854093, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2604057', 'n_tokens_mistral': 209, 'n_tokens_neox': 191, 'n_words': 40}