Debug my code and give clear cut explanation.

class Solution { public: double findMedianSortedArrays(vector& nums1, vector& nums2) { //1).merge the arrays find if the len is even or odd //2).if it is even add the two middle numbers together and then dvide by 2 //3).if it is odd the middle number will be the median int l1 = nums1.size(); int l2 = nums2.size(); int nums3[l1 + l2]; int i = 0, j = 0, k = 0; //start merge here while(i