vishwanathsingh9
BAN USER#include<stdio.h>
#include<stdlib.h>
#include<limits.h>
int input;
int firstOccurence=INT_MAX;
int search(int start,int end,int* array){
// printf("start = %d \n",start);
// printf("end = %d \n",end);
if(start>end){
return -1;
}
if(start == end && array[start] != input ){
return -1;
}
int midval= start+(end-start)/2;
int diff = (array[midval] - input);
if(diff==0){
printf("found");
firstOccurence = (midval<firstOccurence)?midval:firstOccurence;
search(0,midval-1,array);
return midval;
}
diff = (diff<0)?-diff:diff;
int low = midval -2*diff;
int high = midval + 2*diff;
low=(low<start)?start:low;
high=(high>end)?end:high;
//printf("am here");
int left = search(low,midval,array);
int right = search(midval+1,high,array);
return (left<0)?right:left;
}
void main(){
int N;
scanf("%d",&N);
int i=0;
int *array=(int *)malloc(sizeof(int)*N);
for(i=0;i<N;i++){
scanf("%d",array+i);
}
scanf("%d",&input);
int res=search(0,N-1,array);
printf("%d",firstOccurence);
}
#include<stdio.h>
#define N 33
void printfile(FILE *file,long offset,int line){
if(line > N ){
return;
}
if(fseek(file,-1*offset,SEEK_END)!=-1){
char ch=fgetc(file);
if(ch == '\n'){
line++;
}
printfile(file,offset+1,line);
printf("%c",ch);
}
}
void main(){
FILE *file = fopen("file.txt","r");
if(file == NULL){
//printf("file not found \n");
perror("Error");
}
printfile(file,0,1);
}
import java.util.*;
public class Solution {
public String simplifyPath(String path) {
// Start typing your Java solution below
// DO NOT write main() function
Stack<String> stack = new Stack<String>();
String[] str = path.split("/");
for(int i = 0; i<str.length;i++){
String sw = str[i];
switch(sw){
case ".":
break;
case "..":
if(!stack.empty()){
stack.pop();
}
break;
case "":
break;
default:
stack.push(sw);
break;
}
}
String ret="";
while(!stack.empty()){
ret = "/" + stack.pop() + ret;
}
if(ret == ""){
return "/";
}
return ret;
}
public static void main(String[] args){
Solution sol = new Solution();
Scanner sc = new Scanner(System.in);
while(1==1){
String path = sc.nextLine();
String ret=sol.simplifyPath(path);
System.out.println(ret);
}
}
}
- vishwanathsingh9 April 30, 2013
time complexity:O(n)
space complexity:O(1)
- vishwanathsingh9 May 07, 2013