<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Split_token的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Split_token</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Split_token]]></copyright><item><title><![CDATA[在终端cmd输入java、javac、java -version什么都没显示]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/123280854</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/123280854</guid><author>Split_token</author><pubDate>Fri, 04 Mar 2022 17:01:39 +0800</pubDate><description><![CDATA[把javapath的文件夹和环境变量都删除即可

]]></description><category></category></item><item><title><![CDATA[859.亲密字符串。简单易懂0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122763711</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122763711</guid><author>Split_token</author><pubDate>Tue, 01 Feb 2022 13:30:33 +0800</pubDate><description><![CDATA[class Solution {
    public boolean buddyStrings(String s, String goal) {
        int len1 = s.length(), len2 = goal.length();
        if(len1 != len2) return false;

        Set&lt;Character&gt; set = new HashSet&lt;&gt;();
        for(int i = 0; i &lt; l]]></description><category></category></item><item><title><![CDATA[771.宝石与石头]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122762600</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122762600</guid><author>Split_token</author><pubDate>Tue, 01 Feb 2022 01:43:31 +0800</pubDate><description><![CDATA[class Solution {
    public int numJewelsInStones(String jewels, String stones) {
        int len1 = jewels.length(), len2 = stones.length();
        int[] arr = new int[256];
        int res = 0;
        for(int i = 0; i &lt; len1; i++){
            arr[j]]></description><category></category></item><item><title><![CDATA[645.错误的集合。哈希表0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122762473</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122762473</guid><author>Split_token</author><pubDate>Tue, 01 Feb 2022 00:52:36 +0800</pubDate><description><![CDATA[// 哈希中出现2次的是重复元素，未出现的则是缺失元素，返回这两个即可

class Solution {
    public int[] findErrorNums(int[] nums) {
        // 哈希中出现2次的是重复元素，未出现的则是缺失元素，返回这两个即可
        int len = nums.length;
        int[] count = new int[len + 1];
        for(int num : nums) count[num]++;
]]></description><category></category></item><item><title><![CDATA[594.最长和谐子序列。滑动窗口0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122762446</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122762446</guid><author>Split_token</author><pubDate>Tue, 01 Feb 2022 00:42:13 +0800</pubDate><description><![CDATA[class Solution {
    // 滑动窗口
    public int findLHS(int[] nums) {
        Arrays.sort(nums);
        int left = 0, res = 0;
        for(int right = 0; right &lt; nums.length; right++){
            while(nums[right] - nums[left] &gt; 1){
                ++l]]></description><category></category></item><item><title><![CDATA[389.找不同]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122749562</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122749562</guid><author>Split_token</author><pubDate>Sun, 30 Jan 2022 00:38:15 +0800</pubDate><description><![CDATA[字符串s和t中的ascⅡ求和，二者之差就是被添加的字符
class Solution {
    // 字符串s和t中的ascⅡ求和，二者之差就是被添加的字符
    public char findTheDifference(String s, String t) {
        int sum_s = 0, sum_t = 0;
        for (int i = 0; i &lt; s.length(); ++i) {
            sum_s += s.charAt(i);
  ]]></description><category></category></item><item><title><![CDATA[13.罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122748887</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122748887</guid><author>Split_token</author><pubDate>Sun, 30 Jan 2022 00:07:15 +0800</pubDate><description><![CDATA[class Solution {
    public int romanToInt(String s) {
        HashMap&lt;String, Integer&gt; map = new HashMap&lt;&gt;();
        map.put("I", 1);
        map.put("IV", 4);
        map.put("V", 5);
        map.put("IX", 9);
        map.put("X", 10);
     ]]></description><category></category></item><item><title><![CDATA[205.同构字符串，哈希0ms。简单易懂]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122749145</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122749145</guid><author>Split_token</author><pubDate>Sun, 30 Jan 2022 00:07:08 +0800</pubDate><description><![CDATA[题目的意思：s的任意一个字符被t中唯一的字符对应，同时t的任意一个字符被s中唯一的字符对应
class Solution {
    public boolean isIsomorphic(String s, String t) {
        // m1：s到t的映射,m2：t到s的映射
        int[] m1 = new int[256];
        int[] m2 = new int[256];
        for (int i = 0; i &lt; s.length();]]></description><category></category></item><item><title><![CDATA[268.丢失的数字，简单的哈希]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122749314</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122749314</guid><author>Split_token</author><pubDate>Sun, 30 Jan 2022 00:06:57 +0800</pubDate><description><![CDATA[class Solution {
    // 简单的哈希
    public int missingNumber(int[] nums) {
        HashSet&lt;Integer&gt; set = new HashSet&lt;&gt;();
        for(int num : nums) set.add(num);
        for(int i = 0; i &lt;= nums.length; i++){
            if(!set.contains(i)]]></description><category></category></item><item><title><![CDATA[12.整数转罗马数字，贪心。简单易懂0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122748659</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122748659</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 22:43:16 +0800</pubDate><description><![CDATA[贪心:每次尽量使用最大的数来表示。 比如对于 1994 这个数，如果我们每次尽量用最大的数来表示，依次选1000,900,90,4,会得到正确结果MCMXCIV
class Solution {
    // 贪心:每次尽量使用最大的数来表示。 比如对于 1994 这个数，
    // 如果我们每次尽量用最大的数来表示，依次选1000,900,90,4,会得到正确结果MCMXCIV
    public String intToRoman(int num) {
        int[] nums = {]]></description><category></category></item><item><title><![CDATA[面试题17.10.主要元素。摩尔投票法]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122743585</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122743585</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 14:54:25 +0800</pubDate><description><![CDATA[与T169得摩尔投票法不同，本题最后需要对结果进行一个判断：统计出现次数，是否存在主要元素才行。
class Solution {
    // 与T169的略有不同，本题不保证有众数,所以最后需要判断是否存在主要元素
    public int majorityElement(int[] nums) {
        int nums_count = nums[0], count = 1;
        for(int i = 1; i &lt; nums.length; i++){
       ]]></description><category></category></item><item><title><![CDATA[1790.仅执行一次字符串交换能否使两个字符串相等]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122742490</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122742490</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 13:27:31 +0800</pubDate><description><![CDATA[class Solution {
    public boolean areAlmostEqual(String s1, String s2) {
        if (s1.length() != s2.length()) return false;
        int count = 0, m = -1, n = -1;
        for (int i = 0, j = 0; i &lt; s1.length(); i++, j++) {
            if (s1.charAt]]></description><category></category></item><item><title><![CDATA[1512.判断字符串的两半是否相似]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122742117</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122742117</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 13:09:28 +0800</pubDate><description><![CDATA[class Solution {
    public boolean halvesAreAlike(String s) {
       Set&lt;Character&gt; set = new HashSet&lt;&gt;(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
        int len = s.length()/2;
        int count1 = 0, count2 = 0;
     ]]></description><category></category></item><item><title><![CDATA[1394.找出数组中的幸运数，计数排序简单易懂0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122741762</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122741762</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 12:50:23 +0800</pubDate><description><![CDATA[class Solution {
    public int findLucky(int[] arr) {
        int[] result = new int[501];
        for(int i = 0; i &lt; arr.length; i++){
            result[arr[i]]++;
        }
        for(int i = 500; i &gt; 0; i--){
            if(result[i] == i) retu]]></description><category></category></item><item><title><![CDATA[1221.分割平衡字符串，简单易懂最优解]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122741147</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122741147</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 11:43:57 +0800</pubDate><description><![CDATA[加一个减一个，经典题型
class Solution {
    public int balancedStringSplit(String s) {
        int res = 0, count = 0;
        for (int i = 0; i &lt; s.length(); i++) {
            if (s.charAt(i)=='R') ++count;
            if (s.charAt(i) == 'L') --count;
          ]]></description><category></category></item><item><title><![CDATA[1189.“气球”的最大数量，简单易懂0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122740988</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122740988</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 11:28:13 +0800</pubDate><description><![CDATA[class Solution {
    public int maxNumberOfBalloons(String text) {
        int[] ans = new int[26];
        char[] arr = text.toCharArray();
        //记录每个字母出现的次数
        for(int i = 0; i &lt; arr.length; i++){
            ans[arr[i] - 'a']++;
        }
  ]]></description><category></category></item><item><title><![CDATA[713.乘积小于K的子数组，滑动窗口0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122738683</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122738683</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 00:54:40 +0800</pubDate><description><![CDATA[class Solution {
    public int numSubarrayProductLessThanK(int[] nums, int k) {
        if(k == 0 || k == 1) return 0;
        int left = 0;
        int sum = 1, result = 0;
        for(int right = 0; right &lt; nums.length; right++){
            sum = su]]></description><category></category></item><item><title><![CDATA[978.最长涡流子数组]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122737965</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122737965</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 00:01:18 +0800</pubDate><description><![CDATA[T376变形，本题要求连续
class Solution {
    public int maxTurbulenceSize(int[] arr) {
        int len = arr.length;
        int up = 1, down = 1, result = 1;
        for(int i = 1; i &lt; len; i++){
            if(arr[i] &gt; arr[i - 1]){
                up = down ]]></description><category></category></item><item><title><![CDATA[1052.爱生气的书店老板，滑动窗口，简单易懂0ms]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122738288</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122738288</guid><author>Split_token</author><pubDate>Sat, 29 Jan 2022 00:00:59 +0800</pubDate><description><![CDATA[题目有点复杂，简单来说就是求数组指定长度最大和的问题-滑动窗口
class Solution {
    public int maxSatisfied(int[] customers, int[] grumpy, int minutes) {
        
        int sum = 0, len = customers.length;
        for (int i = 0; i &lt; len; i++) {
            // 不生气的部分进行相加，同时把此顾客置0
 ]]></description><category></category></item><item><title><![CDATA[643.子数最大平均数Ⅰ。滑动窗口]]></title><link>https://blog.youkuaiyun.com/Split_token/article/details/122737887</link><guid>https://blog.youkuaiyun.com/Split_token/article/details/122737887</guid><author>Split_token</author><pubDate>Fri, 28 Jan 2022 23:03:52 +0800</pubDate><description><![CDATA[class Solution {
    public double findMaxAverage(int[] nums, int k) {
        int sum = 0, len = nums.length;
        for(int i = 0; i &lt; k; i++) sum += nums[i];
        int max = sum;
        for(int i = k; i &lt; len; i++){
            sum -= nums[i -]]></description><category></category></item></channel></rss>