Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: add solutions to lc problems: No.3029 #2316

Merged
merged 9 commits into from
Feb 4, 2024
Merged

feat: add solutions to lc problems: No.3029 #2316

Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
8894650
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
9dcbbfd
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
2b54b89
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
13837d6
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
c04710b
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
f6391f6
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
874de98
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
94959d1
feat: add solutions to lc problems: No.3029
Nothing-avil Feb 4, 2024
cd3201b
Merge branch 'doocs:main' into main
Nothing-avil Feb 4, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
103 changes: 101 additions & 2 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/README.md
View file
Original file line number Diff line number Diff line change
@@ -70,19 +70,118 @@
<!-- tabs:start -->

```python
class Solution:
def minimumTimeToInitialState(self, word: str, k: int) -> int:
n = len(word)
for i in range(1, 10001):
re = i * k
if re >= n:
return i
if word[re:] == word[:n - re]:
return i
return 0

```

```java

class Solution {
public int minimumTimeToInitialState(String word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
String str = word.substring(re);
boolean flag = true;
for (int j = 0; j < str.length(); j++) {
if (str.charAt(j) != word.charAt(j)) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
}
```

```cpp

class Solution {
public:
int minimumTimeToInitialState(string word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
string str = word.substr(re);
bool flag = true;
for (int j = 0; j < str.length(); j++) {
if (str[j] != word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
};
```

```go
func minimumTimeToInitialState(word string, k int) int {
n := len(word)
for i := 1; i <= 10000; i++ {
re := i * k
if re >= n {
return i
}
str := word[re:]
flag := true
for j := 0; j < len(str); j++ {
if str[j] != word[j] {
flag = false
break
}
}
if flag {
return i
}
}
return 0
}
```

```ts
function minimumTimeToInitialState(word: string, k: number): number {
const n = word.length;
for (let i = 1; i <= 10000; i++) {
const re = i * k;
if (re >= n) {
return i;
}
const str = word.substring(re);
let flag = true;
for (let j = 0; j < str.length; j++) {
if (str[j] !== word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
```

<!-- tabs:end -->
103 changes: 101 additions & 2 deletions ...tion/3000-3099/3029.Minimum Time to Revert Word to Initial State I/README_EN.md
View file
Original file line number Diff line number Diff line change
@@ -63,19 +63,118 @@ It can be shown that 4 seconds is the minimum time greater than zero required fo
<!-- tabs:start -->

```python
class Solution:
def minimumTimeToInitialState(self, word: str, k: int) -> int:
n = len(word)
for i in range(1, 10001):
re = i * k
if re >= n:
return i
if word[re:] == word[:n - re]:
return i
return 0

```

```java

class Solution {
public int minimumTimeToInitialState(String word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
String str = word.substring(re);
boolean flag = true;
for (int j = 0; j < str.length(); j++) {
if (str.charAt(j) != word.charAt(j)) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
}
```

```cpp

class Solution {
public:
int minimumTimeToInitialState(string word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
string str = word.substr(re);
bool flag = true;
for (int j = 0; j < str.length(); j++) {
if (str[j] != word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
};
```

```go
func minimumTimeToInitialState(word string, k int) int {
n := len(word)
for i := 1; i <= 10000; i++ {
re := i * k
if re >= n {
return i
}
str := word[re:]
flag := true
for j := 0; j < len(str); j++ {
if str[j] != word[j] {
flag = false
break
}
}
if flag {
return i
}
}
return 0
}
```

```ts
function minimumTimeToInitialState(word: string, k: number): number {
const n = word.length;
for (let i = 1; i <= 10000; i++) {
const re = i * k;
if (re >= n) {
return i;
}
const str = word.substring(re);
let flag = true;
for (let j = 0; j < str.length; j++) {
if (str[j] !== word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
```

<!-- tabs:end -->
24 changes: 24 additions & 0 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.cpp
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
class Solution {
public:
int minimumTimeToInitialState(string word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
string str = word.substr(re);
bool flag = true;
for (int j = 0; j < str.length(); j++) {
if (str[j] != word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
};
21 changes: 21 additions & 0 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.go
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
func minimumTimeToInitialState(word string, k int) int {
n := len(word)
for i := 1; i <= 10000; i++ {
re := i * k
if re >= n {
return i
}
str := word[re:]
flag := true
for j := 0; j < len(str); j++ {
if str[j] != word[j] {
flag = false
break
}
}
if flag {
return i
}
}
return 0
}
23 changes: 23 additions & 0 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
class Solution {
public int minimumTimeToInitialState(String word, int k) {
int n = word.length();
for (int i = 1; i <= 10000; i++) {
int re = i * k;
if (re >= n) {
return i;
}
String str = word.substring(re);
boolean flag = true;
for (int j = 0; j < str.length(); j++) {
if (str.charAt(j) != word.charAt(j)) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}
}
10 changes: 10 additions & 0 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.py
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
class Solution:
def minimumTimeToInitialState(self, word: str, k: int) -> int:
n = len(word)
for i in range(1, 10001):
re = i * k
if re >= n:
return i
if word[re:] == word[: n - re]:
return i
return 0
21 changes: 21 additions & 0 deletions solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.ts
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
function minimumTimeToInitialState(word: string, k: number): number {
const n = word.length;
for (let i = 1; i <= 10000; i++) {
const re = i * k;
if (re >= n) {
return i;
}
const str = word.substring(re);
let flag = true;
for (let j = 0; j < str.length; j++) {
if (str[j] !== word[j]) {
flag = false;
break;
}
}
if (flag) {
return i;
}
}
return 0;
}