Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

docs(notes): update coding-interview

Browse Source
This commit is contained in:
yanglbme 2018-12-18 19:21:33 +08:00
parent 76ad497f7d
commit 6fe1a049d9
1 changed files with 7 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
notes/剑指 offer 题解.md
View File

@ -628,7 +628,7 @@ f(n) = 2*f(n-1)
所以 f(n) 是一个等比数列 所以 f(n) 是一个等比数列
```source-java ```java
public int JumpFloorII(int target) { public int JumpFloorII(int target) {
return (int) Math.pow(2, target - 1); return (int) Math.pow(2, target - 1);
} }
@ -925,15 +925,10 @@ public double Power(double base, int exponent) {
return 1; return 1;
if (exponent == 1) if (exponent == 1)
return base; return base;
boolean isNegative = false; double pow = Power(base * base, Math.abs(exponent) >> 1);
if (exponent < 0) { if ((exponent & 1) == 1)
exponent = -exponent; pow *= base;
isNegative = true; return exponent < 0 ? 1 / pow : pow;
}
double pow = Power(base * base, exponent / 2);
if (exponent % 2 != 0)
pow = pow * base;
return isNegative ? 1 / pow : pow;
} }
``` ```
@ -998,9 +993,8 @@ public ListNode deleteNode(ListNode head, ListNode tobeDelete) {
return null; return null;
if (tobeDelete.next != null) { if (tobeDelete.next != null) {
// 要删除的节点不是尾节点 // 要删除的节点不是尾节点
ListNode next = tobeDelete.next; tobeDelete.val = tobeDelete.next.val;
tobeDelete.val = next.val; tobeDelete.next = tobeDelete.next.next;
tobeDelete.next = next.next;
} else { } else {
ListNode cur = head; ListNode cur = head;
while (cur.next != tobeDelete) while (cur.next != tobeDelete)