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

auto commit

Browse Source
This commit is contained in:
CyC2018
2018-03-19 16:17:23 +08:00
parent 3ec5475080
commit f8f460525c
1 changed files with 45 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -935,18 +935,18 @@ public boolean isNumeric(char[] str) {
复杂度：O(n<sup>2</sup>) + O(1) 复杂度：O(n<sup>2</sup>) + O(1)
```java ```java
public void reOrderArray(int[] array) { public void reOrderArray(int[] nums) {
int n = array.length; int n = nums.length;
for (int i = 0; i < n; i++) { for (int i = 0; i < n; i++) {
if (array[i] % 2 == 0) { if (nums[i] % 2 == 0) {
int nextOddIdx = i + 1; int nextOddIdx = i + 1;
while (nextOddIdx < n && array[nextOddIdx] % 2 == 0) nextOddIdx++; while (nextOddIdx < n && nums[nextOddIdx] % 2 == 0) nextOddIdx++;
if (nextOddIdx == n) break; if (nextOddIdx == n) break;
int nextOddVal = array[nextOddIdx]; int nextOddVal = nums[nextOddIdx];
for (int j = nextOddIdx; j > i; j--) { for (int j = nextOddIdx; j > i; j--) {
array[j] = array[j - 1]; nums[j] = nums[j - 1];
} }
array[i] = nextOddVal; nums[i] = nextOddVal;
} }
} }
} }
@ -955,14 +955,14 @@ public void reOrderArray(int[] array) {
复杂度：O(n) + O(n) 复杂度：O(n) + O(n)
```java ```java
public void reOrderArray(int[] array) { public void reOrderArray(int[] nums) {
int oddCnt = 0; int oddCnt = 0;
for (int num : array) if (num % 2 == 1) oddCnt++; for (int val : nums) if (val % 2 == 1) oddCnt++;
int[] copy = array.clone(); int[] copy = nums.clone();
int i = 0, j = oddCnt; int i = 0, j = oddCnt;
for (int num : copy) { for (int num : copy) {
if (num % 2 == 1) array[i++] = num; if (num % 2 == 1) nums[i++] = num;
else array[j++] = num; else nums[j++] = num;
} }
} }
``` ```
@ -1026,6 +1026,21 @@ public ListNode EntryNodeOfLoop(ListNode pHead) {
## 解题思路 ## 解题思路
### 递归
```java
public ListNode ReverseList(ListNode head) {
if (head == null || head.next == null) return head;
ListNode next = head.next;
head.next = null;
ListNode newHead = ReverseList(next);
next.next = head;
return newHead;
}
```
### 迭代
```java ```java
public ListNode ReverseList(ListNode head) { public ListNode ReverseList(ListNode head) {
ListNode newList = new ListNode(-1); ListNode newList = new ListNode(-1);
@ -1047,6 +1062,24 @@ public ListNode ReverseList(ListNode head) {
## 解题思路 ## 解题思路
### 递归
```java
public ListNode Merge(ListNode list1, ListNode list2) {
if (list1 == null) return list2;
if (list2 == null) return list1;
if (list1.val <= list2.val) {
list1.next = Merge(list1.next, list2);
return list1;
} else {
list2.next = Merge(list1, list2.next);
return list2;
}
}
```
### 迭代
```java ```java
public ListNode Merge(ListNode list1, ListNode list2) { public ListNode Merge(ListNode list1, ListNode list2) {
ListNode head = new ListNode(-1); ListNode head = new ListNode(-1);