fanxb/demo-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add

Browse Source
This commit is contained in:
fanxb 2024-03-23 20:50:44 +08:00
parent 85737c7e8d
commit 4984a2b597
2 changed files with 72 additions and 49 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
5.leetcode/src/com/fanxb/common/Q33.java Normal file
View File

@ -0,0 +1,53 @@
package com.fanxb.common;
public class Q33 {
public int search(int[] nums, int target) {
int n = nums.length;
if (n == 1) return nums[0] == target ? 0 : -1;
int l = 0, r = n - 1;
while (l < r) {
boolean s = nums[l] < nums[r];
int m = (l + r) / 2;
if (nums[m] == target) {
return m;
} else {
if (nums[m] >= nums[0]) {
//说明m落在左边的升序
if (nums[m] < target) {
if (l == m) l++;
else l = m;
} else {
if (!s && nums[l] > target) {
//说明target在右边的升序里
if (l == m) l++;
else l = m;
} else {
r = m;
}
}
} else {
//m落在右边的升序
if (nums[m] > target) {
r = m;
} else {
if (s || nums[l] > target) {
//说明target在右边的升序里
if (l == m) l++;
else l = m;
} else {
r = m;
}
}
}
}
}
return nums[l] == target ? l : -1;
}
public static void main(String[] args) {
System.out.println(new Q33().search(new int[]{1, 3}, 0));
}
}

68
5.leetcode/src/com/fanxb/common/Q68.java
View File

@ -1,10 +1,5 @@
package com.fanxb.common; package com.fanxb.common;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
/** /**
* Created with IntelliJ IDEA * Created with IntelliJ IDEA
* *
@ -12,55 +7,30 @@ import java.util.List;
* Date: 2020/6/11 9:56 * Date: 2020/6/11 9:56
*/ */
public class Q68 { public class Q68 {
public List<String> fullJustify(String[] words, int maxWidth) { public int searchInsert(int[] nums, int target) {
List<String> res = new ArrayList<>(); int l = 0, r = nums.length - 1;
List<String> temp = new ArrayList<>(); while (l < r) {
int size = words.length, lengthCount = 0, usedWidth = 0; int m = (l + r) / 2;
for (int i = 0; i < size; i++) { if (nums[m] > target) {
lengthCount += words[i].length() + 1; if (r == m) {
if (lengthCount > maxWidth + 1) { l++;
//说明放不下了 } else {
res.add(dealOne(temp, maxWidth, usedWidth, false)); r = m;
temp.clear(); }
usedWidth = 0; } else if (nums[m] == target) {
lengthCount = words[i].length() + 1; return m;
} } else {
temp.add(words[i]); if (l == m) {
usedWidth += words[i].length(); l++;
} } else {
if (!temp.isEmpty()) { l = m;
res.add(dealOne(temp, maxWidth, usedWidth, true));
}
return res;
}
private String dealOne(List<String> temp, int maxWidth, int usedWidth, boolean lastOne) {
StringBuilder res = new StringBuilder();
res.append(temp.get(0));
int size = temp.size();
if (size == 1) return res.append(" ".repeat(maxWidth - usedWidth)).toString();
if (lastOne) {
for (int i = 1; i < size; i++) res.append(' ').append(temp.get(i));
return res.append(" ".repeat(maxWidth - res.length())).toString();
} else {
//每个间隙的长度
int everyWidth = (maxWidth - usedWidth) / (size - 1);
//前几个间隙需要加一个空格
int needPlusCount = (maxWidth - usedWidth) % (size - 1);
for (int i = 1; i < size; i++) {
res.append(" ".repeat(everyWidth));
if (needPlusCount > 0) {
res.append(' ');
needPlusCount--;
} }
res.append(temp.get(i));
} }
} }
return res.toString(); return nums[l] < target ? l + 1 : l;
} }
public static void main(String[] args) { public static void main(String[] args) {
Q68 q68 = new Q68(); System.out.println(new Q68().searchInsert(new int[]{1, 3, 5, 6}, 5));
System.out.println(q68.fullJustify(new String[]{"This", "is", "an", "example", "of", "text", "justification."}, 16).toString());
} }
} }