aspose file tools*
The moose likes Java in General and the fly likes Can The Solution of the problem which i have solved  can be further more improvised Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Java 8 in Action this week in the Java 8 forum!
JavaRanch » Java Forums » Java » Java in General
Reply locked New topic
Author

Can The Solution of the problem which i have solved can be further more improvised

Rahul Shivsharan
Ranch Hand

Joined: Jun 17, 2009
Posts: 83
Given two strings, append them together (known as "concatenation") and return the result. However, if the concatenation creates a double-char, then omit one of the chars, so "abc" and "cat" yields "abcat".

conCat("abc", "cat") → "abcat"
conCat("dog", "cat") → "dogcat"
conCat("abc", "") → "abc" . ........ the code that i have written is as follows
Rob Spoor
Sheriff

Joined: Oct 27, 2005
Posts: 19556
    
  16

Please Use One Thread Per Question. You should have posted this in your previous post. Let's continue there; I'll put a link to this (now closed) thread.


SCJP 1.4 - SCJP 6 - SCWCD 5 - OCEEJBD 6
How To Ask Questions How To Answer Questions
 
I agree. Here's the link: http://aspose.com/file-tools
 
subject: Can The Solution of the problem which i have solved can be further more improvised
 
Similar Threads
string capitalise
generating string
Finding common characters of two strings in O(n)
Can anybody solve the problem without using loop
sorting string with out using predefined java methods