首页 > 代码库 > leetcode423
leetcode423
public class Solution { public string OriginalDigits(string s) { int[] count = new int[10]; for (int i = 0; i < s.Length; i++) { char c = s[i]; if (c == ‘z‘) count[0]++; if (c == ‘w‘) count[2]++; if (c == ‘x‘) count[6]++; if (c == ‘s‘) count[7]++; //7-6 if (c == ‘g‘) count[8]++; if (c == ‘u‘) count[4]++; if (c == ‘f‘) count[5]++; //5-4 if (c == ‘h‘) count[3]++; //3-8 if (c == ‘i‘) count[9]++; //9-8-5-6 if (c == ‘o‘) count[1]++; //1-0-2-4 } count[7] -= count[6]; count[5] -= count[4]; count[3] -= count[8]; count[9] = count[9] - count[8] - count[5] - count[6]; count[1] = count[1] - count[0] - count[2] - count[4]; StringBuilder sb = new StringBuilder(); for (int i = 0; i <= 9; i++) { for (int j = 0; j < count[i]; j++) { sb.Append(i); } } return sb.ToString(); } }
https://leetcode.com/problems/reconstruct-original-digits-from-english/#/description
leetcode423
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。