力扣
Seele-Vollerei
hello world!
展开
-
力扣1869-哪种连续子字符串更长
class Solution { public boolean checkZeroOnes(String s) { if(s.length() < 1) return false; return searchNum(s, '1') > searchNum(s, '0'); } int searchNum(String s, char k){ int count = 0; in...原创 2021-08-31 09:32:14 · 86 阅读 · 0 评论 -
力扣1716- 计算力扣银行的钱
class Solution { public int totalMoney(int n) { int a = n / 7; int sum = 0; for(int i = 1;i <= n/7;i++){ for(int j = i;j < i + 7;j++){ sum += j; } ...原创 2021-08-31 09:28:17 · 69 阅读 · 0 评论 -
力扣1700-无法吃早餐的学生数量
class Solution {public int countStudents(int[] students, int[] sandwiches) { LinkedList<Integer> linkedList= new LinkedList<>(); for(int i=0;i<students.length;i++){ linkedList.add(students[i]); } ...原创 2021-08-31 09:25:15 · 176 阅读 · 0 评论 -
力扣面试题01.01-判定字符是否唯一
class Solution { public boolean isUnique(String astr) { for (int i = 0; i < astr.length(); i++) { for (int j = i+1; j < astr.length(); j++) { if(astr.charAt(i)== astr.charAt(j) )return false; } ...原创 2021-08-31 09:21:31 · 94 阅读 · 0 评论 -
力扣476-数字的补数
class Solution { public int findComplement(int num) { String str = Integer.toBinaryString(num); StringBuffer sb = new StringBuffer(); for (int i = 0; i < str.length(); i++) { if(str.charAt(i)=='0'){ sb...原创 2021-08-30 11:29:27 · 92 阅读 · 0 评论 -
力扣1047-删除字符串中的所有相邻重复项
class Solution { public String toLowerCase(String s) { StringBuffer sb = new StringBuffer(); char[] chars = new char[s.length()]; for (int i = 0; i < s.length(); i++) { if((int)s.charAt(i)>=65&&(in...原创 2021-08-30 11:21:16 · 114 阅读 · 0 评论 -
力扣977-有序数组的平方
class Solution { public int[] sortedSquares(int[] nums) { int[] ints = new int[nums.length]; for (int i = 0; i < nums.length; i++) { ints[i] = nums[i] * nums[i]; } Arrays.sort(ints); return in...原创 2021-08-30 11:09:23 · 66 阅读 · 0 评论 -
力扣709-转换成小写字母
class Solution { public String toLowerCase(String s) { StringBuffer sb = new StringBuffer(); char[] chars = new char[s.length()]; for (int i = 0; i < s.length(); i++) { if((int)s.charAt(i)>=65&&(in...原创 2021-08-30 11:02:19 · 146 阅读 · 0 评论 -
力扣344-反转字符串
class Solution { public void reverseString(char[] s) { int front = 0; int rear = s.length - 1; char temp ; if (s.length % 2 != 0) { while (front!=rear){ temp = s[front]; s[fro...原创 2021-08-30 10:50:59 · 113 阅读 · 0 评论 -
力扣1313- 解压缩编码列表
class Solution { public int[] decompressRLElist(int[] nums) { ArrayList<Integer> list = new ArrayList<>(); for (int i = 1; i < nums.length; i=i+2) { for (int j = 0; j < nums[i-1]; j++) { li...原创 2021-08-30 10:35:33 · 97 阅读 · 0 评论 -
力扣1431-拥有最多糖果的孩子
class Solution { int Maxcandies; public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) { List<Boolean> list = new ArrayList<>(); for (int i = 0; i < candies.length; i++) { if((candie...原创 2021-08-30 10:28:49 · 83 阅读 · 0 评论 -
力扣1844·将所有数字用字符替换
class Solution { public String replaceDigits(String s) { char[] chars = new char[s.length()]; for (int i = 0; i < s.length(); i++) { chars[i]=s.charAt(i); } StringBuffer sb = new StringBuffer(); ...原创 2021-08-30 10:24:06 · 128 阅读 · 0 评论 -
力扣1572- 矩阵对角线元素的和
class Solution { public int diagonalSum(int[][] mat) { int SummaryA = 0,SummaryB = 0; for (int i = 0; i < mat.length; i++) { SummaryA += mat[i][i]; }for (int j = mat.length-1, g = 0; j >= 0&&g&...原创 2021-08-30 10:12:27 · 71 阅读 · 0 评论 -
力扣100-相同的树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */bool isSameTree(struct TreeNode* p, struct TreeNode* q) { if (!p && !q) { return true;...原创 2021-08-29 10:41:07 · 90 阅读 · 0 评论 -
力扣1108-ip地址无效化
class Solution { public String defangIPaddr(String address) { StringBuffer sb = new StringBuffer(); for (int i = 0; i < address.length(); i++) { if(address.charAt(i)=='.'){ sb.append("[.]"); ...原创 2021-08-29 10:25:51 · 83 阅读 · 0 评论 -
力扣1678-设计Goal解析器
class Solution { StringBuffer sb=new StringBuffer(); public String interpret(String s) { if (s == null || s == "") return s; //定义一个顺序栈 ArrayList<Character> Stark = new ArrayList<>(); int ...原创 2021-08-29 10:20:49 · 114 阅读 · 0 评论 -
力扣20-有效的括号
class Solution { public char compare(char cha){ if(cha == '}') return '{'; if(cha == ']') return '['; if(cha == ')') return '('; return 0; } public boolean isValid(String s) { if(s == null||s == ""){ ...原创 2021-08-29 10:10:05 · 69 阅读 · 0 评论 -
力扣1389-按既定顺序创建目标数组
class Solution { public int[] createTargetArray(int[] nums, int[] index) { ArrayList<Integer> arrayList = new ArrayList<>(); int[] target = new int[nums.length]; for (int i = 0; i < nums.length; i++) { ...原创 2021-08-29 10:04:59 · 83 阅读 · 0 评论 -
力扣1832-判断句子是否为全字母句
class Solution { public boolean checkIfPangram(String sentence) { char[] cha = new char[sentence.length()]; for (int i = 0; i < sentence.length(); i++) { cha[i] = sentence.charAt(i); } char[] alphabet = {'...原创 2021-08-29 10:00:33 · 170 阅读 · 0 评论 -
力扣35-搜索插入位置
class Solution { public int searchInsert(int[] nums, int target) { if(nums[0]>=target) return 0; if(nums[nums.length-1]<target) return nums.length; for (int i = 1; i < nums.length; i++) { if(nums[i-1]&l...原创 2021-08-29 09:50:51 · 113 阅读 · 0 评论 -
力扣104-二叉树的最大深度
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */int maxDepth(struct TreeNode* root) { if (!root) { return 0; } int maxLeft = maxDepth(root->l...原创 2021-08-29 09:45:50 · 90 阅读 · 0 评论 -
力扣121-买卖股票的最佳时机
class Solution { public int maxProfit(int[] prices) { int min = prices[0], max = 0; //min记录当前元素之前最小元素;max记录结果 for(int i : prices) { //遍历数组 if(min > i) //判断当前元素是否是最小元素 min = i; max = i - mi...原创 2021-08-29 09:42:27 · 48 阅读 · 0 评论 -
力扣226- 翻转二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */struct TreeNode* invertTree(struct TreeNode* root) { if (!root ) { return root; } invertTree(r...原创 2021-08-28 09:58:41 · 126 阅读 · 0 评论 -
力扣1528- 重新排列字符串
class Solution { public String restoreString(String s, int[] indices) { char[] newChar = new char[s.length()]; char[] restoreChar = new char[s.length()]; for (int i = 0; i < s.length(); i++){ newChar[i] = s.charAt...原创 2021-08-28 09:51:49 · 79 阅读 · 0 评论 -
力扣1281-整数的各位积和之差
class Solution { public static int subtractProductAndSum(int n) { int num; int i = 0; int summary = 0,product=1; int[] everyNum = new int[String.valueOf(n).length()]; while( n != 0){ num = n % 10; ...原创 2021-08-28 09:36:21 · 75 阅读 · 0 评论 -
力扣剑指Offer 58 -Ⅱ 左旋转字符串
class Solution { public static String reverseLeftWords(String s, int n) { char[] newChar = new char[n]; for (int i = 0; i < n; i++) { newChar[i] = s.charAt(i); } String front = new String(newChar); char...原创 2021-08-28 09:30:29 · 64 阅读 · 0 评论 -
力扣237- 删除链表中的节点
java/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public void deleteNode(ListNode node) { node.val = node.next.v...原创 2021-08-28 09:22:07 · 55 阅读 · 0 评论 -
力扣面试题02.03- 删除中间节点
java/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public void deleteNode(ListNode node) { node.val = node.next.val; ...原创 2021-08-28 09:16:56 · 66 阅读 · 0 评论 -
力扣1· 两数之和
class Solution { public int[] twoSum(int[] nums, int target) { int num1 = 0,num2=0; int[] twoSum = new int[2]; for (int i = 0; i < nums.length; i++) { for (int g = i+1; g < nums.length; g++) { ...原创 2021-08-28 09:11:29 · 57 阅读 · 0 评论 -
力扣1833-雪糕的最大数量
class Solution { public static int maxIceCream(int[] costs, int coins) { Arrays.sort(costs); int summary=0,account = 0; for (int i = 0; i < costs.length; i++) { summary += costs[i]; if(summary>co...原创 2021-08-28 09:08:02 · 79 阅读 · 0 评论 -
力扣1486-数组异或操作
![在这里插入图片描述](https://img-blog.csdnimg.cn/ff42ef29e2644f7983a1a8a344aa09ae.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAU2VlbGUtVm9sbGVyZWk=,size_16,color_FFFFFF,t_70,g_se,x_16#pic_center)class Solution { pub.原创 2021-08-27 13:54:21 · 66 阅读 · 0 评论 -
力扣1475-商品折扣后的最终价格
class Solution { public int[] finalPrices(int[] prices) { for (int i = 0; i < prices.length; i++) { for (int g = i+1; g < prices.length; g++) { if (prices[i]>=prices[g]){ prices[i] = ...原创 2021-08-27 10:26:49 · 167 阅读 · 0 评论 -
力扣1732-找到最高海拔
class Solution { public static int largestAltitude(int[] gain) { int max=0; int[] high = new int[gain.length+1]; high[0] = 0; for (int i = 0; i < gain.length; i++) { high[i+1] = ...原创 2021-08-27 10:22:39 · 115 阅读 · 0 评论 -
力扣1295-统计位数为偶数的数字
public class Solution { public int findNumbers(int[] nums) { int accountNum=0; for (int i = 0; i < nums.length; i++) { int accountBit = 0; //通缉这个数有多少位 while(nums[i]!=0){ nums[i] ...原创 2021-08-27 10:18:23 · 84 阅读 · 0 评论 -
力扣1342-将数字变成0的操作次数
class Solution { int account=0; public int numberOfSteps(int num) { while (num>0) { if (num % 2 == 0) { num = num / 2; account++; } if (num % 2 != 0) { ...原创 2021-08-27 10:14:32 · 99 阅读 · 0 评论 -
力扣LCP-01 猜数字
public class Solution { public int game(int[] guess, int[] answer) { int account = 0; for (int i = 0, g = 0; i < guess.length && g <answer.length; i++,g++) { if(guess[i]==answer[g]){ account+...原创 2021-08-27 10:09:55 · 69 阅读 · 0 评论 -
力扣1662-检查两个字符串数组是否相等
public class Solution { public boolean arrayStringsAreEqual(String[] word1, String[] word2) { String newString1 = ""; String newString2 = ""; for (int i = 0; i < word1.length; i++) { newString1 += word1[i];...原创 2021-08-26 11:54:06 · 78 阅读 · 0 评论 -
力扣LCP-06 拿硬币
public class Solution { public int minCount(int[] coins) { int summary = 0; for (int i = 0; i < coins.length; i++) { if(coins[i]==1){ summary += 1; } else if(coins[i]%2 == 0){ ...原创 2021-08-26 11:43:21 · 134 阅读 · 0 评论 -
力扣7-整数反转
class Solution { public int reverse(int x) { double a = x; boolean flag = false; if(0 == x){ return 0; } String s = Integer.toString(x); String t = ""; String d = ""; for (i...原创 2021-08-26 11:32:47 · 107 阅读 · 0 评论 -
力扣1470-重新排列数组
class Solution { public int[] shuffle(int[] nums, int n) { int nextAccount=0,frontAccount=0; int[] front = new int[nums.length/2]; int[] next = new int[nums.length/2]; int[] array = new int[nums.length]; for (...原创 2021-08-26 11:27:56 · 94 阅读 · 0 评论