tag:blogger.com,1999:blog-5872623838295077986.post5957991703633608136..comments2024-03-20T01:07:56.465-07:00Comments on JavaProblems.com - Free coding problems and exercises: Java > AP-1 > sumHeights2 (CodingBat Solution)Unknownnoreply@blogger.comBlogger4125tag:blogger.com,1999:blog-5872623838295077986.post-29385353149467822232020-10-13T02:40:20.720-07:002020-10-13T02:40:20.720-07:00public int sumHeights2(int[] heights, int start, i... public int sumHeights2(int[] heights, int start, int end) {<br /> int sumHeight = 0;<br /> for (int i = start; i < end; i++) {<br /> sumHeight += heights[i] < heights[i + 1] ? 2 * (Math.abs(heights[i] - heights[i + 1])) : Math.abs(heights[i] - heights[i + 1]);<br /> }<br /> return sumHeight;<br /> }Anonymoushttps://www.blogger.com/profile/18315574734870276996noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-80101035529496636782019-03-04T07:58:12.731-08:002019-03-04T07:58:12.731-08:00public int bigHeights(int[] heights, int start, in...public int bigHeights(int[] heights, int start, int end) {<br /> int counter = 0;<br /> for(int i = start; i < end; i++) {<br /> if(heights[i] < heights[i+1]) {<br /> if(heights[i+1] - heights[i] >= 5) {<br /> counter++;<br /> }<br /> }<br /> if(heights[i] > heights[i+1]) {<br /> if(heights[i] - heights[i+1] >= 5) {<br /> counter++;<br /> }<br /> }<br /> }<br /> return counter;<br />}<br />Anonymoushttps://www.blogger.com/profile/01803316709362595721noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-13950944720191480612018-02-22T18:39:03.526-08:002018-02-22T18:39:03.526-08:00public int sumHeights2(int[] heights, int start, i...public int sumHeights2(int[] heights, int start, int end) {<br /> int sumHeight = 0;<br /> for(int i = start; i < end; i++)<br /> {<br /> sumHeight += (heights[i] < heights[i+1]) ? 2*(heights[i+1] - heights[i]) : heights[i] - heights[i+1];<br /> }<br /> return sumHeight;<br />}<br />Ternary is usefulAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-62129308535016352802017-09-23T13:58:23.809-07:002017-09-23T13:58:23.809-07:00public int sumHeights2(int[] heights, int start, i...public int sumHeights2(int[] heights, int start, int end) {<br /> int sum = 0;<br /> int diff = 0;<br /> for (int i = start; i < end; i++) {<br /> if (i + 1 <= end) {<br /> if (heights[i] > heights[i + 1]) {<br /> diff = Math.abs(heights[i] - heights[i + 1]);<br /> sum += diff;<br /> }<br /> else{<br /> diff = 2*( Math.abs(heights[i] - heights[i + 1]));<br /> sum+=diff;<br /> }<br /> }<br /> }<br /> return sum;<br />}Anonymoushttps://www.blogger.com/profile/07539221051114624194noreply@blogger.com