private boolean slowAndFastSolution(ListNode head) { if (head == null) { return false; } ListNode slow = head; ListNode fast = head.next; while (fast Read More
public int add(int a, int b) { while (a != 0) { int temp = a ^ b; a = (a & b) << 1; b = temp; } return b; } Read More
public int divide(int dividend, int divisor) { boolean sign = (dividend > 0) ^ (divisor > 0); int result = 0; if(dividend>0) { dividend = -dividend; } Read More
public int divide(int dividend, int divisor) { //判断符号 int symbol=(dividend>0&&divisor>0)||(dividend<0&&divisor<0)?1:-1; //边界情况直接返回 if(dividend==Intege Read More
public ListNode removeNthFromEnd(ListNode head, int n) { ListNode dummy = new ListNode(0); dummy.next = head; ListNode first = dummy; ListNode second Read More