перепиши этот код на С# def main(): someInt = 124 num = str(someInt) listOfNums =…
- User
перепиши этот код на С# def main(): someInt = 124 num = str(someInt) listOfNums = set([int(''.join(nums)) for nums in itertools.permutations(num, len(num))])
listOfNums = sorted(list(listOfNums)) try: print(listOfNums[listOfNums.index(someInt)+1]) except Exception: print(-1) - Assistant
void Main() { int someInt = 124; string num = someInt.ToString(); var listOfNums = new SortedSet(GetPermutations(num).Select(nums => int.Parse(string.Concat(nums)))); try { Console.WriteLine(listOfNums.ElementAt(listOfNums.ToList().IndexOf(someInt) + 1)); } catch (Exception) { Console.WriteLine(-1); } }
IEnumerable<IEnumerable> GetPermutations(IEnumerable list) { return list.Count() == 1 ? new[] { list } : list.SelectMany((item, index) => GetPermutations(list.Where((_, i) => i != index)).Select(permutation => new[] { item }.Concat(permutation))); }
- User
давай без GetPermutations
- Assistant
void Main() { int someInt = 124; string num = someInt.ToString();
var listOfNums = new List<int>(); Permute(num.ToCharArray(), 0, num.Length - 1, listOfNums); listOfNums.Sort(); try { Console.WriteLine(listOfNums[listOfNums.IndexOf(someInt) + 1]); } catch (Exception) { Console.WriteLine(-1); }}
void Permute(char[] arr, int l, int r, List listOfNums) { if (l == r) { listOfNums.Add(int.Parse(new string(arr))); } else { for (int i = l; i <= r; i++) { Swap(ref arr[l], ref arr[i]); Permute(arr, l + 1, r, listOfNums); Swap(ref arr[l], ref arr[i]); } } }
void Swap(ref char a, ref char b) { char temp = a; a = b; b = temp; }
- User
перепиши этот код на C#: Integer[] val = Long.toString(n).chars().map(c -> c - '0').boxed().toArray(Integer[]::new); int len = val.length; for (int i = len - 1; i > 0; i--) { if (val[i - 1] > val[i]) { int maxIdx = i; for (int j = i + 1; j < len; j++) { if (val[i - 1] > val[j] && val[j] > val[maxIdx]) maxIdx = j; } val[i - 1] = val[i - 1] + val[maxIdx]; val[i - 1] = val[i - 1] - (val[maxIdx] = val[i - 1] - val[maxIdx]);
Arrays.sort(val, i, len, Collections.reverseOrder()); return val[0] == 0 ? - 1L : Long.valueOf(String.join("", Stream.of(val).map(String::valueOf).toArray(String[]::new))); } } return -1L; - Assistant
int[] val = n.ToString().Select(c => c - '0').ToArray(); int len = val.Length; for (int i = len - 1; i > 0; i--) { if (val[i - 1] > val[i]) { int maxIdx = i; for (int j = i + 1; j < len; j++) { if (val[i - 1] > val[j] && val[j] > val[maxIdx]) { maxIdx = j; } } val[i - 1] = val[i - 1] + val[maxIdx]; val[i - 1] = val[i - 1] - (val[maxIdx] = val[i - 1] - val[maxIdx]);
Array.Sort(val, i, len, Comparer<int>.Create((x, y) => y.CompareTo(x))); if (val[0] == 0) { return -1L; } else { return long.Parse(string.Join("", val.Select(d => d.ToString()).ToArray())); } }} return -1L;
- User
System.ArgumentException: "Offset and length were out of bounds for the array or count is greater than the number of elements from index to the end of the source collection." на Array.Sort(val, i, len, Comparer.Create((x, y) => y.CompareTo(x)));
- Assistant
Извините за ошибку. Здесь правильный исправленный код:
int[] val = n.ToString().Select(c => c - '0').ToArray(); int len = val.Length; for (int i = len - 1; i > 0; i--) { if (val[i - 1] > val[i]) { int maxIdx = i; for (int j = i + 1; j < len; j++) { if (val[i - 1] > val[j] && val[j] > val[maxIdx]) { maxIdx = j; } } val[i - 1] = val[i - 1] + val[maxIdx]; val[i - 1] = val[i - 1] - (val[maxIdx] = val[i - 1] - val[maxIdx]); Array.Sort(val, i, len - i, Comparer<int>.Create((x, y) => y.CompareTo(x))); if (val[0] == 0) { return -1L; } else { return long.Parse(string.Join("", val.Select(d => d.ToString()).ToArray())); } } } return -1L;В строке
Array.Sort(val, i, len - i, Comparer<int>.Create((x, y) => y.CompareTo(x)));был изменен последний аргументlenнаlen - i, чтобы указать правильную длину для сортировки части массива.
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.