在matlab中实现leetcode-notes 42.收集雨水左指针aur右指针lo, paani toh un logo ke bich me hi bharega, toh minimum kaunsa hai woh paani woh building ke upper aayega。 public int trap( int [] A ){ int a = 0 ; int b = A . length - 1 ; int max = 0 ; int leftmax = 0 ; int rightmax = 0 ; while (a <= b){ leftmax = Math . max(leftmax, A [a]); rightmax = Math . max(rightmax, A [b]); if (leftmax < rightmax xss=removed>