TerrorGeek
BAN USERThe Country is China? WTF????
- TerrorGeek June 19, 2014<code class=" language-java">
public static String wocao(String p1,String p2){
if(p1.charAt(0)=='/') p1=p1.substring(1);
String arr_p1[]=p1.split("/");
Stack<String> stack_p1=new Stack<String>();
for(int i=0;i<arr_p1.length;i++)
stack_p1.push(arr_p1[i]);
String arr_p2[]=p2.split("/");
for(int i=0;i<arr_p2.length;i++){
if(!arr_p2[i].equals("..")){
stack_p1.push(arr_p2[i]);
}
else{
stack_p1.pop();
}
}
StringBuilder sb=new StringBuilder();
while(!stack_p1.isEmpty()){
sb.insert(0,stack_p1.pop()+"/");
}
return sb.toString().substring(0,sb.toString().length()-1);
}
</code>
public static String sum(String s1,String s2){
if(s1.length()==0||s2.length()==0) return s1.length()==0 ? s1 : s2;
else{
int carry=0;int sum=0;
StringBuffer sb=new StringBuffer();
int first=s1.length()-1;int second=s2.length()-1;
while(first>=0||second>=0){
int firstValue=first<0? 0 : Integer.valueOf(s1.charAt(first));
int secondValue=second<0? 0 : Integer.valueOf(s2.charAt(second));
sum=firstValue+secondValue+carry;
carry=sum>>1;
sum&=1;
sb.append(sum==0? "0":"1");
first--;second--;
}
return sb.toString();
}
public static void revert(char arr[],int start,int end,int num){
if(num>=arr.length/2) return;
for (int i = end; i>=start; i--) {
System.err.println(arr);
char temp=arr[i];
arr[i]=arr[i-1];
arr[i-1]=temp;
//System.err.println(arr);
}
for (int i = start; i <end; i++) {
System.err.println(arr);
char temp=arr[i];
arr[i]=arr[i+1];
arr[i+1]=temp;
// System.err.println(arr);
}
revert(arr, start+1, end-1,num+1);
}
public static void Encrypt(){
String in="aaaabbbcccccccdddgggggg";
StringBuilder sb=new StringBuilder("");
int count=0;
char c=in.charAt(0);
for (int i = 0; i < in.length(); i++) {
if(c==in.charAt(i)) count++;
else {
sb=sb.append(c);
sb.append(count);
c=in.charAt(i);
count=1;
}
}
sb.append(c);
sb.append(count);
System.out.println(sb.toString());
}
<pre class="language-java">
public static void Encrypt(){
String in="aaaabbbcccccccdddgggggg";
StringBuilder sb=new StringBuilder("");
int count=0;
char c=in.charAt(0);
for (int i = 0; i < in.length(); i++) {
if(c==in.charAt(i)) count++;
else {
sb=sb.append(c);
sb.append(count);
c=in.charAt(i);
count=1;
}
}
sb.append(c);
sb.append(count);
System.out.println(sb.toString());
}
</pre>
static boolean flag=false;
public static void inOrder(TreeNode root,int judge){
if(root!=null){
inOrder(root.left,judge);
if(flag) {
System.out.println(root.data);
flag=false;
}
if(root.data==judge) flag=true;
inOrder(root.right,judge);
}
}
t4.left=t3;t4.right=t5;
t3.left=t1;t3.right=t2;
t5.right=t7;t7.right=t6;
Integer judge=10;
inOrder(t4, judge);
public static int findDepth(String input){
Stack<Character> stack=new Stack<Character>();
int max=Integer.MIN_VALUE;
for (int i = 0; i < input.length(); i++) {
if(input.charAt(i)=='('){
stack.push(input.charAt(i));
}
if(input.charAt(i)==')'){
max=Math.max(max, stack.size());
stack.pop();
}
}
return max;
}
package sy;
public class Solution {
public static void main(String[] args) {
int a[]={3,2,6,4,49,7,43,68,7,3};
find_2th_largest(a);
}
public static void find_2th_largest(int input[])
{
int max=Integer.MIN_VALUE;
int second_max=Integer.MIN_VALUE;
for (int i = 0; i < input.length; i++) {
if(input[i]>=max)
{
second_max=max;
max=input[i];
}
}
System.out.println(max);
System.out.println(second_max);
}
}
package sy;
public class Solution {
public static void main(String[] args) {
int a[]={3,2,6,4,49,7,43,68,7,3};
find_2th_largest(a);
}
public static void find_2th_largest(int input[])
{
int max=Integer.MIN_VALUE;
int second_max=Integer.MIN_VALUE;
for (int i = 0; i < input.length; i++) {
if(input[i]>=max)
{
second_max=max;
max=input[i];
}
}
System.out.println(max);
System.out.println(second_max);
}
}
{package nb;
import java.sql.Array;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.Map;
public class bit
{
public static int i = 0;
public static StringBuilder sb = new StringBuilder();
public static int curR = 0;
public static int curC = 0;
public static int destR=0;
public static int destC=0;
public static void main(String[] args) {
char a[]={'a','b','c','d','e'};
getPath(5, a,0);
}
public static void getPath(int w, char[] str,int i) {
if(i<str.length){
destR = (str[i] - 'a') / w;
destC = (str[i] - 'a') % w;
if (curC > destC) {
sb.append('l');
curC--;
getPath(w, str,i);
}
else if(curR > destR) {
sb.append('u');
curR--;
getPath(w, str, i);
}
else if(curC < destC) {
sb.append('r');
curC++;
getPath(w, str, i);
}
else if(curR < destR) {
sb.append('d');
curR++;
getPath(w, str, i);
}
else{
sb.append('!');
getPath(w, str, i+1);
}
}
if(i==str.length)
System.out.println(sb.toString());
}
}
}
public class Solve {
public static void main(String[] args) throws Exception {
Deal_With_It("plxY");
}
public static String Deal_With_It(String str){
int number[]=new int[str.length()];
if(str.length()==0)
return "";
if(str.length()==1)
return str.toUpperCase();
for (int i = 0; i < str.length(); i++) {
number[i]=(int)str.charAt(i);
}
if(number[number.length-1]>=89)
number[number.length-1]=64+(90-number[number.length-1]);
else
number[number.length-1]+=2;
String result="";
for (int i = 0; i < number.length-1; i++) {
result+=Character.toString((char)(number[i]+2));
}
result+=Character.toString((char)number[number.length-1]);
System.err.println(result);
return "";
}
}
<pre class=" language-java">
- TerrorGeek June 20, 2014<code class=" language-java">
public class CombinationsK {
// print all subsets that take k of the remaining elements, with given prefix
public static void comb1(String s, int k) { comb1(s, "", k); }
private static void comb1(String s, String prefix, int k) {
if (s.length() < k) return;
else if (k == 0) System.out.println(prefix);
else {
comb1(s.substring(1), prefix + s.charAt(0), k-1);
comb1(s.substring(1), prefix, k);
}
}
// print all subsets that take k of the remaining elements, with given prefix
public static void comb2(String s, int k) { comb2(s, "", k); }
private static void comb2(String s, String prefix, int k) {
if (k == 0) System.out.println(prefix);
else {
for (int i = 0; i < s.length(); i++)
comb2(s.substring(i + 1), prefix + s.charAt(i), k-1);
}
}
// read in N and k from command line, and print all subsets of size k from N elements
public static void main(String[] args) {
int N = Integer.parseInt(args[0]);
int k = Integer.parseInt(args[1]);
String alphabet = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
String elements = alphabet.substring(0, N);
comb1(elements, k);
System.out.println();
comb2(elements, k);
}
}
</code>
</pre>