public int reverseInteger(int n) { // Write your code here int num = Math.abs(n); int res = 0; while(num != 0) { if(res > (Integer.MAX_VALUE – num%10) / 10) return 0; // corn case; res = res*10 + num %10; num /= 10; } return n > 0 ? res : -res; }
public String addBinary(String a, String b) { // int carry=0; // String result=””; // int i=0; // int alen=a.length(); // int blen=b.length(); // while(i<alen||i<blen||carry!=0){ // int x=(i<alen)?((a.charAt(alen-1-i)==’1′)?1:0):0; // int y=(i<blen)?((b.charAt(blen-1-i)==’1′)?1:0):0; // result=(x+y+carry)%2+result; // carry=(x+y+carry)/2; // i++; int carry = 0; String res = “”; int i = 0; int aLen = a.length(); int bLen = […]
public boolean isPalindrome(String s) { // Write your code here if(s.length() == 0 || s == null) return true; s = s.toLowerCase(); s = s.trim(); int i = 0; int j = s.length() – 1; while(i <= j) { while(i <= j && !((s.charAt(i) <= ‘z’ && s.charAt(i) >= ‘a’) || (s.charAt(i) >= ‘0’ && […]
public List<Interval> merge(List<Interval> intervals) { // write your code here List<Interval> res= new ArrayList<Interval>(); if(intervals.size() == 0 || intervals == null) return res; Collections.sort(intervals, new IntervalComparator()); Interval first = intervals.get(0); for(int i = 1; i < intervals.size(); i++) { Interval cur = intervals.get(i); if(cur.start <= first.end) { first.end = Math.max(cur.end, first.end); }else{ res.add(first); first = […]