题目要求 Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Note: S string length is in [1, 10000]. C is a single character, and guaranteed to be in string S. All letters…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 过两遍数组 日期 题目地址:https://leetcode.com/problems/shortest-distance-to-a-character/description/ 题目描述 Given a string S and a character C, return an array of integers representing the…

Question 821. Shortest Distance to a Character Solution 思路:遍历字符串S,遇到与字符C相等就分别向左/右计算其他字符与该字符的距离,如果其他字符就是C或与目标字符的距离更小的话遍历就终止. Java实现: public int[] shortestToChar(String S, char C) { int[] store = new int[S.length()]; for (int i = 0; i < S.length(); i++…

problem 821. Shortest Distance to a Character solution1: class Solution { public: vector<int> shortestToChar(string S, char C) { int n = S.size(); vector<int> res(n, n); ; i<n; ++i) ; ; i<n; ++i) res[i] = min(res[i], abs(res[i-]+)); ; i&…

Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Example 1: Input: S = "loveleetcode", C = 'e' Output: [3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0] Note: S string leng…

Difficulty: Easy Problem Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Example 1: Input: S = "loveleetcode", C = 'e' Output: [3, 2, 1, 0, 1, 0, 0, 1, 2, 2,…

Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Example 1: Input: S = "loveleetcode", C = 'e' Output: [3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0] Note: S string leng…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 字典+二分查找 日期 题目地址:https://leetcode-cn.com/problems/shortest-distance-to-target-color/ 题目描述 You are given an array colors, in which there are three colors: 1, 2 and 3. You are also…

class Solution { public: vector<int> shortestToChar(string S, char C) { int len=S.length(); vector<); //as the result vector vector<int> cindex; //save the index of C ;i<len;i++) //write the distance of C and build the cindex if(S[i]==C)…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 日期 题目地址:https://leetcode.com/problems/maximize-distance-to-closest-person/description/ 题目描述 In a row of seats, 1 represents a person sitting in that seat, and 0 represents that…