Merge pull request #4 from Megha1209/patch-2

Create lc673.java

code/lc673.java

+public static int findNumberOfLIS(int[] arr) {
+		if(arr.length<=1) return arr.length;
+		
+		int n=arr.length;
+		int[] dp=new int[n];
+		int[] count=new int[n];
+		
+		int maxLen=0;
+		int maxCount=0;
+		
+		for(int i=0;i<n;i++){
+			dp[i]=1;
+			count[i]=1;
+			for(int j=0;j<i;j++){
+			  if(arr[i]>arr[j]){
+                 if(dp[j] + 1 > dp[i]){
+					 dp[i]=dp[j]+1;
+					 count[i]=count[j];
+				 }else if(dp[j]+1==dp[i]){
+					 count[i]+=count[j];
+				 }
+			  }	
+			}
+
+			if(dp[i]>maxLen){
+				maxLen=dp[i];
+				maxCount=count[i];
+			}else if(dp[i]==maxLen){
+				maxCount+=count[i];
+			}
+		}
+
+		return maxCount;
+
+		
+	}