asd
BAN USERpublic static List<String> continousInt(int a[]){
if(a.length == 0)
return null;
List <String > l = new LinkedList<String>();
int i = 0;
String s = ""+a[i];
int last = a[i];
i++;
while(i<a.length){
if(last+1 ==a[i]){
s = s +a[i];
}else{
l.add(s);
s= ""+a[i];
}
last = a[i];
i++;
}
l.add(s);
return l;
}
import java.util.Arrays;
import java.util.Comparator;
class LengthCom implements Comparator<Integer> {
@Override
public int compare(Integer o1, Integer o2) {
String s1 = o1.toString();
String s2 = o2.toString();
int len = s1.length() - s2.length();
if(len>0){
s1 = s1.substring( s2.length());
}
if(len <0 ){
s2 = s2.substring( s1.length());
}
int f1 = Integer.parseInt(s1);
int f2 = Integer.parseInt(s2);
if(f1>f2)
return -1;
if(f1<f2)
return 1;
return 0;
}
}
public class NumberSorting {
public static void main(String st[]){
int a[] ={9,94,4,14,1};
Integer []aInt = new Integer[a.length];
int i = 0;
while (a.length >i){
aInt[i] = a[i];
i++;
}
LengthCom com = new LengthCom();
Arrays.sort(aInt,com);
for(Integer ad : aInt)
System.out.print(ad+", ");
}
}
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
public class AnagramInaLine {
public static String sortString(String s){
char cs[] = s.toLowerCase().toCharArray();
Arrays.sort(cs);
return new String(cs);
}
public static void main(String st[]){
String para= "Parts of the world have sunlight for close to 24 hours during summer. Dan went to the north pole to lead an expedition during summer. He had a strap on his head to identify himself as the leader. Dan had to deal with the sun never going down for 42 consecutive days and his leadership strap soon became a blindfold. He wondered what kind of traps lay ahead of him";
Set<String> l = null;
Map <String,Set<String>> map = new HashMap <String,Set<String>>();
StringTokenizer t = new StringTokenizer(para);
while(t.hasMoreElements()){
String stg = (String) t.nextElement();
String modS = sortString(stg);
if(map.containsKey(modS)){
l = map.get(modS);
l.add(stg);
}else {
Set<String> l1 = new java.util.HashSet<String>();
l1.add(stg);
map.put(modS,l1);
}
}
for(String s : map.keySet()){
map.get(s);
if(map.get(s).size()>1){
for(String ls :map.get(s))
{
System.out.print(ls+" ");
}
System.out.println();
}
}
}
}
public class DivideArrayinEqual {
public static void main(String st[])
{
int a[]={-1, -2, 0, -3};
int sum = 0;
for(int i =0 ;i<a.length;i++)
{
sum = a[i]+sum;
}
int sumleft =0;
// sum = sum-a[0];
for(int i=0;i<a.length;i++)
{
sumleft =sumleft+a[i];
if(sumleft == sum-sumleft)
{
System.out.println("sum equal at i ="+i);
return;
}
}
}
}
how many _ are possible?
- asd November 20, 2012