algorithm/interview.java at master · dumblejd/algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
package algorithmtest;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class interview {


	public static void findlongestsub(String s)  //最大非重复单个字符 的
	{
		Map<Character,Integer> m = new HashMap<Character,Integer>();
		String out="";
		for(int i=0;i<s.length();i++)
		{
			int index=i;
			while(index<s.length())
			{
				if(m.containsKey(s.charAt(index)))
				{
					out=out.length()>m.size()?out:s.substring(i, index);
					m = new HashMap<Character,Integer>();
					break;
				}
				else
				{
					m.put(s.charAt(index), 1);
				}
				index++;
			}
		}
		System.out.println(out);
	}
    public static int longestPalindrome(String s) {  //find sub palindrome
        StringBuffer sb=new StringBuffer();
        for(int i=0;i<s.length();i++)
        {
            sb.append("#");
            sb.append(s.charAt(i));
        }
        sb.append("#");
        int max=0;
        char [] c = sb.toString().toCharArray();
        for(int i=0;i<c.length;i++)
        {
            max=Math.max(max,search(c,i));
        }
        return max;
    }
    public static int search(char[]c,int index)
    {
        int max=0;
        for(int i=0;i+index<c.length&&index-i>=0;i++)
        {
            if(c[index-i]==c[index+i])
            {
                max++;
            }
        }
        return max-1;
    }
    //#409 easy
    public static int longestPalindrome409(String s) {
        int[]c =new int[26];
        for(int i=0;i<s.length();i++)
        {
            c[s.charAt(i)-'a']++;
        }
        int single=0;
        int max=0;
        for(int temp:c)
        {
            if(temp%2==0)
            {
                max+=temp;
            }
            else
            {
                single=1;
                max+=temp-1;
            }
        }
        max=max+single;
        return max;
    }
    public static int longestPalindrome_dp(String s)
    {
    	boolean [][]dp=new boolean[s.length()][s.length()];
    	int max=0;
//    	for(int i=0;i<s.length();i++)
//    	{
//    		dp[i][i]=true;
//    	}
    	for(int i=0;i<s.length();i++)
    	{
    		for(int j=0;j+i<s.length();j++)
    		{
    			if(j==i+j)
    			{
    				dp[j][j+i]=true;

    			}
    			else if(i==1)
    			{
    				dp[j][j+i]=(s.charAt(i+j)==s.charAt(j));
    			}
    			else
    			{
    				dp[j][j+i]=dp[j+1][j+i-1]&&(s.charAt(i+j)==s.charAt(j));
    			}
    			if(dp[j][j+i])
    			{
    				max=Math.max(max,i+1);
    			}
    		}
    	}
    	return max;
    }

    public static void intToBinary(int num)
    {
    	StringBuffer sb = new StringBuffer();
    	if(num==0)
    	{
    		System.out.println("0");
    		return;
    	}
    	while(num>0)
    	{
    		int left=num%2;
    		sb.insert(0, left);
    		num=num/2;
    	}
    	System.out.println(sb.toString());
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		findlongestsub("abbccdbabcdccdd");
		longestPalindrome_dp("aabbabac");
		intToBinary(1024);
	        Scanner sc = new Scanner(System.in);
	        int size=sc.nextInt();
	        int []input=new int[size*2];
	        for(int i=0;i<input.length;i++)
	        {
	            input[i]=sc.nextInt();
	            System.out.println(input[i]);
	        }

	}

}