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/MissingNumber_01.java at master · learning-zone/java-basics Expand file tree/ Copy pathMissingNumber_01.javaMore file actions 24 lines (23 loc) · 601 Bytes / Copy pathMissingNumber_01.javaFile metadata and controls24 lines (23 loc) · 601 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; /** * Logic:- * 01. Find the sum of n number using formula n=n*(n+1)/2 * 02. Subtract (sum of n numbers – sum of elements present in the array). * */ public class MissingNumber_01 { public static int missingNumber(int[] arr) { int n = arr.length + 1; int sum = n * (n + 1) / 2; int restSum = 0; for(int i = 0; i< arr.length; i++ ) { restSum += arr[i]; } int missingNumber = sum - restSum; return missingNumber; } public static void main(String[] args) { int[] arr = {1, 2, 3, 4, 6, 7, 8}; System.out.println("Missing Number: " +missingNumber(arr)); } } |
| 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. |