Merge pull request ronijpandey#37 from atulim/master

ronijpandey · web-flow · commit 35751fe3c119 · 2017-10-30T12:19:22.000+05:30
Added a line
diff --git a/JavaDateAndTime.java b/JavaDateAndTime.java
@@ -16,9 +16,18 @@ public class JavaDateAndTime {
     public static String getDay(String day, String month, String year) {
           
         int y = Integer.parseInt(year);
+        /**
+          * Converts the String type year into integer type y using parseInt() method)
+       */   
+       
         int m = Integer.parseInt(month);
+        /**
+           * Converts the String type month into integer type y using parseInt() method)
+       */   
         int d = Integer.parseInt(day);
-          
+          /**
+           * Converts the String type day into integer type y using parseInt() method)
+       */   
         Calendar c = Calendar.getInstance();
         c.set(y, m-1, d); 
             
diff --git a/Palindrome_or_not.java b/Palindrome_or_not.java
@@ -3,36 +3,25 @@
 Descritpion : A Palindrome number is a number that remains the same when its digits are reversed. Like 16461, for example: we take 121 and reverse it, after revers it is same as original number
 */
 
+/*
+This code is much shorter written in java
+*/
 import java.util.Scanner;
 
-class P{
-
-public static void main(String args[])
+class Palindrome_or_not
 {
-int n,x,i,number;
-
-boolean f=true;
-
-Scanner sc= new Scanner(System.in);
-
-number = sc.nextInt();
-
-String str = Integer.toString(number);
-
-String strArr[] = str.split("");
-
-x = str.length();
-n=x/2;
-for(i=0;i<n;i++)
-{
-if(strArr[i].compareTo(strArr[--x])!=0)
-{f=false;break;}
-}
-
-if(f==true)
-System.out.print(str +" is palindrome ");
-
-else
-System.out.print( str+" is not a palindrome");
+  public static void main(Sting args[])
+  {
+    Scanner x = new Scanner(System.in);
+    
+    String st=x.next();
+    String w="";
+    int i;
+    for(i=0;i<st.length();i++)
+      w=st.charAt(i)+w;
+    if(st.compareTo(w)==0)
+      System.out.prinltn("Number is Pallindrome");
+    else
+      System.out.println("Number is Not Pallindrome");
+  }
 }
-} 
diff --git a/README.md b/README.md
@@ -1,2 +1,3 @@
 # Java-Codes
 classroom programs of java.
+Contains many codes for the sole purpose of encouraging open source development
diff --git a/Root.java b/Root.java
@@ -1,9 +1,9 @@
 /* This program is to find value of root node in a tree 
 when value of each node and sum of child nodes of all nodes is given. */
 
-package javacodes;
+package javacodes;    //encapsulates a group of classes into a package called javacodes
 
-import java.util.*;     //import packages
+import java.util.*;     //import package of util class
 
 public class Root{       
     
diff --git a/SizeOfNumber.java b/SizeOfNumber.java
@@ -1,6 +1,6 @@
 import java.io.*;
 import java.util.*;
-class SizeOfNumber {
+class SIZEOFNUMBER {
  public static void main(String[] args) {
   Scanner sc = new Scanner(System.in);
   int t = sc.nextInt();

Original file line number	Diff line number	Diff line change
`@@ -1,2 +1,3 @@`
`1`	`1`	`# Java-Codes`
`2`	`2`	`classroom programs of java.`
	`3`	`+Contains many codes for the sole purpose of encouraging open source development`