GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — java-basics/java-programs/MaximalSubarray.java at master · learning-zone/java-basics Expand file tree/ Copy pathMaximalSubarray.javaMore file actions 24 lines (21 loc) · 555 Bytes / Copy pathMaximalSubarray.javaFile metadata and controls24 lines (21 loc) · 555 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 package misc; public class MaximalSubarray { private static int[] arr = {1, -2, 3, 4, -9, 6}; private int getMaxSubSum(int[] arr) { int maxSum = 0; int partialSum = 0; for(int i = 0; i < arr.length; i++) { partialSum += arr[i]; maxSum = Math.max(maxSum, partialSum); if(partialSum < 0) { partialSum = 0; // Zero if negative } } return maxSum; } public static void main(String[] args) { MaximalSubarray obj = new MaximalSubarray(); int sum = obj.getMaxSubSum(arr); System.out.println("Sum: "+sum); // 3 + 4 = 7 } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |