2020年8月30日
判断链表是否有环
private boolean slowAndFastSolution(ListNode head) { if (head == null) { return false; } ListNode slow = head; ListNode fast = head.next; while (fast Read More
posted @ 2020-08-30 12:57 soft.push("zzq") Views(92) Comments(0) Diggs(0)
位运算做加法
public int add(int a, int b) { while (a != 0) { int temp = a ^ b; a = (a & b) << 1; b = temp; } return b; } Read More
posted @ 2020-08-30 12:49 soft.push("zzq") Views(122) Comments(0) Diggs(0)
模拟除法（高效1ms）
public int divide(int dividend, int divisor) { boolean sign = (dividend > 0) ^ (divisor > 0); int result = 0; if(dividend>0) { dividend = -dividend; } Read More
posted @ 2020-08-30 12:46 soft.push("zzq") Views(209) Comments(0) Diggs(0)
模拟除法
public int divide(int dividend, int divisor) { //判断符号 int symbol=(dividend>0&&divisor>0)||(dividend<0&&divisor<0)?1:-1; //边界情况直接返回 if(dividend==Intege Read More
posted @ 2020-08-30 12:44 soft.push("zzq") Views(177) Comments(0) Diggs(0)
删除链表倒数第n个节点
public ListNode removeNthFromEnd(ListNode head, int n) { ListNode dummy = new ListNode(0); dummy.next = head; ListNode first = dummy; ListNode second Read More
posted @ 2020-08-30 10:07 soft.push("zzq") Views(88) Comments(0) Diggs(0)